ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   7 80
17
17
30669 Ada and Trip   15 309
16
14
5151 Alice‚Äôs Cube   7 468
26
23
26445 Alicias Afternoon Amble   9 123
19
26
4555 Einbahnstrasse   1 457
25
10
372 The Benefactor   39 2492
11
12
4182 Candy (Again)   2 203
34
34
9126 Time to live   39 1585
12
15
3763 George   14 477
20
18
3381 Highways   55 3333
10
9
6256 Inversion Count   415 11679
16
18
4181 MELE3   15 558
21
21
1845 Mice and Maze   67 4300
9
9
16272 Nanoworld   1 36
17
17
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 124
3405 Almost Shortest Path   64 1423
22
21
15 The Shortest Path   104 4851
17
12
26663 Theater shade in Berland   1 24
34
17
3643 Traffic Network   69 1655
18
21
1700 Traveling by Stagecoach   8 324
19
17
6294 Yodaness Level   54 2842
14
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