ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   4 65
12
17
30669 Ada and Trip   10 245
16
16
5151 Alice‚Äôs Cube   7 459
26
23
26445 Alicias Afternoon Amble   8 116
19
25
4555 Einbahnstrasse   1 452
25
10
372 The Benefactor   34 2337
13
12
4182 Candy (Again)   1 174
34
34
9126 Time to live   29 1361
11
14
3763 George   12 381
20
18
3381 Highways   46 3072
11
9
6256 Inversion Count   363 10745
16
18
4181 MELE3   14 543
20
21
1845 Mice and Maze   59 3968
9
9
16272 Nanoworld   1 34
17
17
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 124
3405 Almost Shortest Path   56 1346
22
21
15 The Shortest Path   86 4377
18
13
26663 Theater shade in Berland   1 22
34
17
3643 Traffic Network   60 1538
18
21
1700 Traveling by Stagecoach   5 302
17
15
6294 Yodaness Level   51 2659
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