ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

28451  Ada and Cities  9  114 


30669  Ada and Trip  27  545 


5151  Alice’s Cube  7  483 


26445  Alicias Afternoon Amble  11  177 


4555  Einbahnstrasse  3  472 


372  The Benefactor  48  2857 


40642  Chips Challenge  1  2 


4182  Candy (Again)  2  212 


9126  Time to live  48  1906 


3763  George  14  494 


3381  Highways  70  3788 


4181  MELE3  18  581 


1845  Mice and Maze  87  4868 


16272  Nanoworld  1  35 


215  Panic in the Plazas  77 


2047  Stone Removing Game  1  127 


3405  Almost Shortest Path  76  1578 


15  The Shortest Path  148  5983 


26663  Theater shade in Berland  1  22 


3643  Traffic Network  81  1839 


1700  Traveling by Stagecoach  8  347 


6294  Yodaness Level  72  3286 

#shortestpath
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
https://en.wikipedia.org/wiki/Shortest_path_problem https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm