ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

28451  Ada and Cities  3  50 


30669  Ada and Trip  8  193 


5151  Alice’s Cube  7  450 


26445  Alicias Afternoon Amble  8  80 


4555  Einbahnstrasse  446 


372  The Benefactor  30  2215 


4182  Candy (Again)  1  172 


9126  Time to live  24  1239 


3763  George  12  375 


3381  Highways  43  2904 


6256  Inversion Count  328  10131 


4181  MELE3  14  527 


1845  Mice and Maze  56  3681 


16272  Nanoworld  1  31 


215  Panic in the Plazas  77 


2047  Stone Removing Game  1  124 


3405  Almost Shortest Path  49  1253 


15  The Shortest Path  79  4058 


26663  Theater shade in Berland  1  22 


3643  Traffic Network  50  1448 


1700  Traveling by Stagecoach  5  296 


6294  Yodaness Level  48  2568 

#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