This commit is contained in:
Michael Zhang 2016-10-10 09:28:13 -05:00
parent 04e38cf502
commit 4beb8ce3f2

View file

@ -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`.