ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   4 57
12
17
30669 Ada and Trip   9 211
17
16
5151 Alice‚Äôs Cube   7 452
26
23
26445 Alicias Afternoon Amble   8 84
19
25
4555 Einbahnstrasse   447
23
9
372 The Benefactor   33 2247
12
12
4182 Candy (Again)   1 173
34
34
9126 Time to live   27 1273
11
14
3763 George   12 375
20
18
3381 Highways   43 2944
11
10
6256 Inversion Count   343 10336
15
18
4181 MELE3   14 531
20
21
1845 Mice and Maze   57 3718
10
9
16272 Nanoworld   1 34
17
17
215 Panic in the Plazas   77
2047 Stone Removing Game   -1 124
3405 Almost Shortest Path   52 1279
23
21
15 The Shortest Path   79 4163
19
13
26663 Theater shade in Berland   1 22
34
17
3643 Traffic Network   52 1475
19
21
1700 Traveling by Stagecoach   5 296
17
15
6294 Yodaness Level   48 2592
14
15

#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