ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

28451  Ada and Cities  3  41 


30669  Ada and Trip  7  115 


5151  Alice’s Cube  6  429 


26445  Alicias Afternoon Amble  6  65 


4555  Einbahnstrasse  432 


372  The Benefactor  28  2048 


4182  Candy (Again)  1  170 


9126  Time to live  21  1095 


3763  George  12  354 


3381  Highways  33  2633 


6256  Inversion Count  275  9209 


4181  MELE3  13  507 


1845  Mice and Maze  50  3343 


16272  Nanoworld  26 


215  Panic in the Plazas  77 


2047  Stone Removing Game  1  121 


3405  Almost Shortest Path  44  1171 


15  The Shortest Path  70  3622 


26663  Theater shade in Berland  1  20 


3643  Traffic Network  38  1293 


1700  Traveling by Stagecoach  1  264 


6294  Yodaness Level  44  2389 

#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