With this simple application, you can calculate the shortest paths from a node to the others nodes in a graph, using the Dijkstra Algorithm (also called SPF or Shortest Path First).
With this simple application, you can calculate the shortest paths from a node to the others nodes in a graph, using the Dijkstra Algorithm (also called SPF or Shortest Path First).