ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   9 104
19
17
30669 Ada and Trip   24 438
14
11
5151 Alice‚Äôs Cube   7 481
26
23
26445 Alicias Afternoon Amble   11 180
20
26
4555 Einbahnstrasse   3 469
22
9
372 The Benefactor   42 2732
12
13
4182 Candy (Again)   2 217
34
34
9126 Time to live   47 1842
12
15
3763 George   14 493
20
18
3381 Highways   65 3646
10
9
6256 Inversion Count   487 12960
16
18
4181 MELE3   16 579
20
21
1845 Mice and Maze   83 4668
9
9
16272 Nanoworld   1 37
17
17
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 127
3405 Almost Shortest Path   74 1536
22
21
15 The Shortest Path   137 5546
16
12
26663 Theater shade in Berland   1 24
34
17
3643 Traffic Network   77 1785
18
20
1700 Traveling by Stagecoach   8 347
19
17
6294 Yodaness Level   68 3137
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