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).
ID на пакет: com.csacanam.dijkstracalculatorSHA1 подпис: B0:CB:07:39:3E:1E:11:51:11:86:0A:25:76:8C:6C:97:4D:62:A9:BCРазработчик (CN): MinimalОрганизация (O):Местен (L): CaliДържава (C):Област/град (ST): Valle del CaucaID на пакет: com.csacanam.dijkstracalculatorSHA1 подпис: B0:CB:07:39:3E:1E:11:51:11:86:0A:25:76:8C:6C:97:4D:62:A9:BCРазработчик (CN): MinimalОрганизация (O):Местен (L): CaliДържава (C):Област/град (ST): Valle del Cauca