ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   10 124
19
17
30669 Ada and Trip   31 650
14
12
5151 Alice‚Äôs Cube   7 493
25
21
26445 Alicias Afternoon Amble   11 179
20
26
4555 Einbahnstrasse   2 479
22
9
372 The Benefactor   48 2922
12
13
40642 Chips Challenge   1 8
17
17
4182 Candy (Again)   2 221
34
34
9126 Time to live   48 1973
12
15
3763 George   15 510
19
18
3381 Highways   74 3981
9
9
4181 MELE3   18 591
20
21
1845 Mice and Maze   92 5067
10
10
16272 Nanoworld   1 35
17
17
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 128
3405 Almost Shortest Path   78 1605
22
21
15 The Shortest Path   154 6535
16
12
26663 Theater shade in Berland   1 22
34
17
3643 Traffic Network   86 1875
18
21
1700 Traveling by Stagecoach   9 383
19
17
6294 Yodaness Level   74 3384
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