ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

28451  Ada and Cities  4  60 


30669  Ada and Trip  9  223 


5151  Alice’s Cube  7  458 


26445  Alicias Afternoon Amble  8  86 


4555  Einbahnstrasse  448 


372  The Benefactor  34  2308 


4182  Candy (Again)  1  173 


9126  Time to live  29  1317 


3763  George  12  376 


3381  Highways  45  3011 


6256  Inversion Count  355  10553 


4181  MELE3  14  537 


1845  Mice and Maze  58  3915 


16272  Nanoworld  1  34 


215  Panic in the Plazas  77 


2047  Stone Removing Game  1  124 


3405  Almost Shortest Path  55  1310 


15  The Shortest Path  83  4269 


26663  Theater shade in Berland  1  22 


3643  Traffic Network  55  1494 


1700  Traveling by Stagecoach  5  301 


6294  Yodaness Level  50  2630 

#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