ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   9 114
19
17
30669 Ada and Trip   27 545
14
12
5151 Alice‚Äôs Cube   7 483
26
23
26445 Alicias Afternoon Amble   11 177
20
26
4555 Einbahnstrasse   3 472
22
9
372 The Benefactor   48 2857
12
13
40642 Chips Challenge   1 2
17
17
4182 Candy (Again)   2 212
34
34
9126 Time to live   48 1906
12
15
3763 George   14 494
20
18
3381 Highways   70 3788
10
9
4181 MELE3   18 581
20
21
1845 Mice and Maze   87 4868
10
9
16272 Nanoworld   1 35
17
17
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 127
3405 Almost Shortest Path   76 1578
22
21
15 The Shortest Path   148 5983
16
12
26663 Theater shade in Berland   1 22
34
17
3643 Traffic Network   81 1839
18
21
1700 Traveling by Stagecoach   8 347
19
17
6294 Yodaness Level   72 3286
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