remvoed bug in dijkstra

src/GTT/Algorithms.cs

@@ -131,6 +131,7 @@ public static G_Updates Dijkstra(byte nodeCount, byte[,] edges, byte source, byt
 			do
 			{
 				byte u = queue.Dequeue();
+				if(color[u]>=2) continue;
 				color[u] = 2;
 				yield return new(u, AllowedColors[2], $"Now exporing node {GameApp.GetLabel(u)}");
 				if (u == dest)
@@ -199,14 +200,14 @@ public static G_Updates Kruskal(byte nodeCount, byte[,] edges)
 					yield return new(from, to, AllowedColors[5], $"Adding this edge will introduce a cycle\nEdge {text} is discarded");
 				else
 				{
-					yield return new(from, to, AllowedColors[0], $"This edge can be included in the MST.\n Edge {text} is included");
+					yield return new(from, to, AllowedColors[4], $"This edge can be included in the MST.\n Edge {text} is included");
 					cost += weight;
 					i++;
 					sets.Merge(from, to);
 				}
 				if (i == nodeCount)
 				{
-					yield return new(255, AllowedColors[0], $"MST of cost {cost} is formed with the edges marked with white color");
+					yield return new(255, AllowedColors[4], $"MST of cost {cost} is formed with the edges marked with green color");
 					yield break;
 				}
 			}
@@ -227,18 +228,19 @@ public static F_Updates FloydWarshall(byte nodeCount, byte[,] edges)
 			yield return new("Initializing the matrix from the adjacency matrix");
 			for (i = 0; i < nodeCount; i++)
 			{
-				yield return new($"Pass {i+1}");
+				yield return new($"Pass {i + 1}");
 				for (j = 0; j < nodeCount; j++)
 				{
 					if (i == j) continue;
 					for (k = 0; k < nodeCount; k++)
 					{
 						if (k == i || k == j || matrix[i, k] == 0 || matrix[j, i] == 0) continue;
 						uint newdist = matrix[j, i] + matrix[i, k];
-						if (matrix[j, k] == 0 || newdist < matrix[j, k])
+						uint olddist = matrix[j, k];
+						if (olddist == 0 || newdist < olddist)
 						{
 							matrix[j, k] = newdist;
-							yield return new(j, k, newdist, $"Updated distance between {GameApp.GetLabel(j)} and {GameApp.GetLabel(k)} to {newdist}");
+							yield return new(j, k, newdist, $"Updated distance between {GameApp.GetLabel(j)} and {GameApp.GetLabel(k)} to {newdist} instead of {(olddist != 0 ? olddist.ToString() : "INF")}");
 						}
 					}
 				}