Real time computation of shortest path dynamically alter agent path based on edge weights

[mjcortejo]

Related to #22

[mjcortejo]

This is actually the right algorithm for digraph like implementations

https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_spanning_arborescence.html

[mjcortejo]

Actually the previous comment is wrong, this might be the one

https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path.html#networkx.algorithms.shortest_paths.weighted.dijkstra_path

[mjcortejo]

weight attribute has been implemented. Next step is to observe the car's behaviors based on these attributes