ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   9 96
19
17
30669 Ada and Trip   23 387
14
11
5151 Alice‚Äôs Cube   7 474
26
23
26445 Alicias Afternoon Amble   9 175
19
26
4555 Einbahnstrasse   3 466
22
9
372 The Benefactor   42 2690
12
13
4182 Candy (Again)   2 213
34
34
9126 Time to live   45 1774
12
14
3763 George   14 484
20
18
3381 Highways   65 3563
10
9
6256 Inversion Count   475 12565
16
18
4181 MELE3   16 572
20
21
1845 Mice and Maze   82 4569
9
9
16272 Nanoworld   1 37
17
17
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 125
3405 Almost Shortest Path   72 1505
22
21
15 The Shortest Path   124 5307
17
12
26663 Theater shade in Berland   1 24
34
17
3643 Traffic Network   74 1734
18
20
1700 Traveling by Stagecoach   8 341
19
17
6294 Yodaness Level   66 3071
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