What
This commit is contained in:
parent
4beb8ce3f2
commit
de13b172c8
1 changed files with 1 additions and 1 deletions
|
@ -1,6 +1,6 @@
|
|||
This is a high-level programming challenge. Given a set of vertices corresponding to the map below, your program must output the shortest path from `a` to `z`.
|
||||
|
||||
![image](`{dijkstra_map_svg}`)
|
||||
![image](${dijkstra_map_svg})
|
||||
|
||||
The length of the line segments is randomized such that the length (`l`) satisfies `20 <= l <= 120`.
|
||||
|
||||
|
|
Loading…
Reference in a new issue