ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   2 34
17
17
30669 Ada and Trip   3 77
17
17
5151 Alice‚Äôs Cube   6 412
27
24
26445 Alicias Afternoon Amble   6 60
21
28
4555 Einbahnstrasse   426
23
9
372 The Benefactor   24 1929
14
13
4182 Candy (Again)   1 163
34
34
9126 Time to live   17 943
11
14
3763 George   11 345
20
19
3381 Highways   26 2367
11
10
6256 Inversion Count   248 8523
15
17
4181 MELE3   12 489
20
22
1845 Mice and Maze   41 3105
9
8
16272 Nanoworld   8
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 117
3405 Almost Shortest Path   40 1105
23
23
15 The Shortest Path   61 3331
20
14
26663 Theater shade in Berland   1 20
34
17
3643 Traffic Network   33 1203
18
22
1700 Traveling by Stagecoach   1 244
13
9
6294 Yodaness Level   41 2263
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