ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   10 134
19
17
30669 Ada and Trip   34 810
14
11
5151 Alice‚Äôs Cube   8 502
24
21
26445 Alicias Afternoon Amble   11 185
20
26
4555 Einbahnstrasse   2 483
22
9
372 The Benefactor   48 3007
12
13
40642 Chips Challenge   1 22
17
17
4182 Candy (Again)   2 226
34
34
9126 Time to live   48 2013
12
15
3763 George   15 519
19
18
3381 Highways   77 4252
10
9
4181 MELE3   19 607
20
21
1845 Mice and Maze   97 5297
10
10
16272 Nanoworld   1 38
17
17
215 Panic in the Plazas   82
34
34
2047 Stone Removing Game   -1 132
3405 Almost Shortest Path   79 1652
22
21
15 The Shortest Path   155 7375
17
12
26663 Theater shade in Berland   1 25
34
17
3643 Traffic Network   89 2073
18
21
1700 Traveling by Stagecoach   9 433
19
17
6294 Yodaness Level   74 3499
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