ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   8 90
20
17
30669 Ada and Trip   19 362
16
14
5151 Alice‚Äôs Cube   7 471
26
23
26445 Alicias Afternoon Amble   9 174
19
26
4555 Einbahnstrasse   2 462
25
10
372 The Benefactor   42 2649
12
13
4182 Candy (Again)   2 210
34
34
9126 Time to live   44 1724
12
14
3763 George   14 483
20
18
3381 Highways   59 3509
9
9
6256 Inversion Count   452 12286
16
18
4181 MELE3   16 564
20
21
1845 Mice and Maze   78 4464
9
9
16272 Nanoworld   1 37
17
17
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 125
3405 Almost Shortest Path   69 1480
22
21
15 The Shortest Path   117 5157
17
12
26663 Theater shade in Berland   1 24
34
17
3643 Traffic Network   69 1695
18
21
1700 Traveling by Stagecoach   8 332
19
17
6294 Yodaness Level   64 3012
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