ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

28451  Ada and Cities  4  57 


30669  Ada and Trip  9  211 


5151  Alice’s Cube  7  452 


26445  Alicias Afternoon Amble  8  84 


4555  Einbahnstrasse  447 


372  The Benefactor  33  2247 


4182  Candy (Again)  1  173 


9126  Time to live  27  1273 


3763  George  12  375 


3381  Highways  43  2944 


6256  Inversion Count  343  10336 


4181  MELE3  14  531 


1845  Mice and Maze  57  3718 


16272  Nanoworld  1  34 


215  Panic in the Plazas  77 


2047  Stone Removing Game  1  124 


3405  Almost Shortest Path  52  1279 


15  The Shortest Path  79  4163 


26663  Theater shade in Berland  1  22 


3643  Traffic Network  52  1475 


1700  Traveling by Stagecoach  5  296 


6294  Yodaness Level  48  2592 

#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