ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

28451  Ada and Cities  9  102 


30669  Ada and Trip  25  468 


5151  Alice’s Cube  7  481 


26445  Alicias Afternoon Amble  11  180 


4555  Einbahnstrasse  3  469 


372  The Benefactor  43  2781 


4182  Candy (Again)  2  211 


9126  Time to live  47  1859 


3763  George  14  491 


3381  Highways  66  3688 


1845  Mice and Maze  85  4726 


16272  Nanoworld  1  37 


215  Panic in the Plazas  77 


2047  Stone Removing Game  1  127 


3405  Almost Shortest Path  76  1538 


15  The Shortest Path  138  5703 


26663  Theater shade in Berland  1  24 


1700  Traveling by Stagecoach  8  347 


6294  Yodaness Level  68  3181 

#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