Update dijkstra.c (TheAlgorithms#928)

in this way valgrind checks will pass and result will stay the same (functions as a static variable)
nieyuyao · Jan 11, 2022 · 0ceb3b3 · 0ceb3b3
1 parent bd06a9f
commit 0ceb3b3
Showing 1 changed file with 2 additions and 1 deletion.
diff --git a/data_structures/graphs/dijkstra.c b/data_structures/graphs/dijkstra.c
@@ -32,7 +32,8 @@ void addEdge(struct Graph *G, int src, int dst, int weight)
 // Utility function to find minimum distance vertex in mdist
 int minDistance(int mdist[], int vset[], int V)
 {
-    int minVal = INT_MAX, minInd;
+    int minVal = INT_MAX;
+    static int minInd = -1; //remembers the previous value if not modified in the loop
     for (int i = 0; i < V; i++)
         if (vset[i] == 0 && mdist[i] < minVal)
         {