ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

28451  Ada and Cities  4  65 


30669  Ada and Trip  10  245 


5151  Alice’s Cube  7  459 


26445  Alicias Afternoon Amble  8  116 


4555  Einbahnstrasse  1  452 


372  The Benefactor  34  2337 


4182  Candy (Again)  1  174 


9126  Time to live  29  1361 


3763  George  12  381 


3381  Highways  46  3072 


6256  Inversion Count  363  10745 


4181  MELE3  14  543 


1845  Mice and Maze  59  3968 


16272  Nanoworld  1  34 


215  Panic in the Plazas  77 


2047  Stone Removing Game  1  124 


3405  Almost Shortest Path  56  1346 


15  The Shortest Path  86  4377 


26663  Theater shade in Berland  1  22 


3643  Traffic Network  60  1538 


1700  Traveling by Stagecoach  5  302 


6294  Yodaness Level  51  2659 

#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