minor bug fixes in node connecting algorithm

All starting positions are valid.
Check for feasibility of map is not yet done.

introduced cities and intersections. These will make up the sparse network. THen you can add trainstations to the cities and populate them with tasks for agents (start/target). Orientation of agents needs to be fixed. Also check for invalid transitions in cities and nodes needs to be implemented.

introduced cities and intersections. These will make up the sparse network. THen you can add trainstations to the cities and populate them with tasks for agents (start/target). Orientation of agents needs to be fixed. Also check for invalid transitions in cities and nodes needs to be implemented.

not functional yet

updated malfunction behavior. Now a train can break at any point during its travel. We don't count number of stops anymore. This is to simulate more complex stochastic events.

Updated test for generators to check that distance map is not recomputed when loaded correctly

Additional package msgpack-numpy needed for ndarray.
This saves tons of time when loading precomputed files.
Updated test to test loading and saving with and without distance maps

also added new prediction rendering
editor still broken with this update

It now sets all the info from pickle file before running all the prediction and observations.
Also added a test for file load
UPDATE: Edited the test

It now sets all the info from pickle file before running all the prediction and observations.
Also added a test for file load