updated pseudocode

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;