ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

28451  Ada and Cities  3  41 


30669  Ada and Trip  8  136 


5151  Alice’s Cube  6  432 


26445  Alicias Afternoon Amble  7  68 


4555  Einbahnstrasse  435 


372  The Benefactor  28  2082 


4182  Candy (Again)  1  171 


9126  Time to live  22  1111 


3763  George  12  356 


3381  Highways  35  2667 


6256  Inversion Count  283  9328 


4181  MELE3  13  511 


1845  Mice and Maze  50  3392 


16272  Nanoworld  28 


215  Panic in the Plazas  77 


2047  Stone Removing Game  1  121 


3405  Almost Shortest Path  45  1184 


15  The Shortest Path  72  3693 


26663  Theater shade in Berland  1  20 


3643  Traffic Network  43  1326 


1700  Traveling by Stagecoach  1  266 


6294  Yodaness Level  44  2404 

#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