From de13b172c807926d5f1f09c2ffe39f761cda21ab Mon Sep 17 00:00:00 2001
From: Michael Zhang <me@michaelz.xyz>
Date: Mon, 10 Oct 2016 09:29:05 -0500
Subject: [PATCH] What

---
 dijkstra/description.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/dijkstra/description.md b/dijkstra/description.md
index 399f027..80240a6 100644
--- a/dijkstra/description.md
+++ b/dijkstra/description.md
@@ -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`.