Run: change the source and target value to get the path.(nodes should be there in the graph for the code to work)
-
Networkx used for finding the shortest path using djikstra.
-
Node file contains nodes with their x y coordinates
-
Edge file contains edges with their respective weights
-
Using djikstra and only showing the shortest path in a graph.
-
Visualization of this networkx is coupled with matplotlib.
-
Dynamic edges are also added and removed to showcase the modularity of the code.
(Highlighted path in red is the shortest path taken)