+ Dijkstra |
+
+ Find the shortest path between different cities in
+ Belgium with Dijkstra algorithm
+
+
+
+
+
+
+
+
+
Starting Point
+
+
+
+
+
+
+
Destination
+
+
+
+
+
+
+
+ {errorSelect.flag &&
{errorSelect.message}
}
+
+
+
+
+ {graph.nodes.length > 0 && (
+ {
+ // if you want access to vis.js network api you can set the state in a parent component using this property
+ }}
+ />
+ )}
+
+
+
+ {shortestPath && (
+
+
+ Shortest path from {startingPoint.name} to{' '}
+ {destination.name} ({shortestPath.distance}
+ km)
+