ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   3 37
17
17
30669 Ada and Trip   4 90
17
17
5151 Alice‚Äôs Cube   6 418
27
24
26445 Alicias Afternoon Amble   6 61
21
28
4555 Einbahnstrasse   428
23
9
372 The Benefactor   26 1988
13
12
4182 Candy (Again)   1 165
34
34
9126 Time to live   19 998
11
15
3763 George   12 349
20
18
3381 Highways   26 2487
11
10
6256 Inversion Count   254 8745
15
17
4181 MELE3   13 495
20
21
1845 Mice and Maze   45 3193
10
9
16272 Nanoworld   8
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 119
3405 Almost Shortest Path   40 1128
23
23
15 The Shortest Path   65 3437
20
13
26663 Theater shade in Berland   1 20
34
17
3643 Traffic Network   33 1237
18
22
1700 Traveling by Stagecoach   1 247
13
9
6294 Yodaness Level   41 2302
15
16

#shortest-path

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