ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   3 39
17
17
30669 Ada and Trip   5 98
21
21
5151 Alice‚Äôs Cube   6 426
27
24
26445 Alicias Afternoon Amble   6 64
21
28
4555 Einbahnstrasse   429
23
9
372 The Benefactor   28 2016
13
12
4182 Candy (Again)   1 165
34
34
9126 Time to live   20 1059
12
15
3763 George   12 352
20
18
3381 Highways   30 2560
10
10
6256 Inversion Count   267 8951
15
17
4181 MELE3   13 497
20
21
1845 Mice and Maze   45 3267
9
9
16272 Nanoworld   8
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 119
3405 Almost Shortest Path   42 1147
23
24
15 The Shortest Path   66 3530
19
13
26663 Theater shade in Berland   1 20
34
17
3643 Traffic Network   36 1261
18
21
1700 Traveling by Stagecoach   1 257
13
9
6294 Yodaness Level   42 2344
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