updated pseudocode

df.md

@@ -63,7 +63,7 @@ void dijkstra(graph g, int src, int num, int dist[num], int prev[num]) {
     dist[src] = 0; // all other distances are INT_MAX
     prev[src] = -1; // previous node is undefined
     
-    queue_init(q, (source, 0));
+    queue_init(q, (src, 0));
 
     while (!queue_is_empty(q)) {
         p = queue_pop(q);