diff --git a/df.md b/df.md
index 9f67647f2aac6f3b7a41a75b2f79e8a5b4008922..9bd23cbfc5f4a6f969d02013eafd83a31fc77d23 100644
--- a/df.md
+++ b/df.md
@@ -68,7 +68,7 @@ void dijkstra(graph g, int src, int num, int dist[num], int prev[num]) {
     while (!queue_is_empty(q)) {
         p = queue_pop(q);
         for v in the neighborhood of p {
-            d_new = dist[v] + distance(p, v);
+            d_new = dist[v] + weight(p, v);
             if (d_new < dist[v]) {
                 dist[v] = d_new;
                 prev[v] = p;