Added descriptions to various graph algo codes .

Author: sonicdashh

Graph_Algorithms/BellmanFord.cpp

@@ -1,3 +1,6 @@
+// This algorithm is used to find the shortest path from a single source vertex to all other vertices, even in the presence of negative weight edges. It can detect negative weight cycles.
+
+
 #include <iostream>
 #include <vector>
 #include <climits>

Graph_Algorithms/DSU.cpp

@@ -1,3 +1,5 @@
+//DSU is a data structure used to manage a partition of a set into disjoint subsets. It supports operations like union (merging two subsets) and find (finding the representative element of a subset). 
+
 #include <iostream>
 #include <vector>
 

Graph_Algorithms/Dijkstra.cpp

@@ -1,3 +1,7 @@
+
+// Dijkstra's algorithm is a widely used algorithm for finding the shortest path from a single source vertex to all other vertices in a weighted graph. It's particularly useful for graphs with non-negative edge weights. 
+
+
 #include <iostream>
 #include <vector>
 #include <queue>

Graph_Algorithms/Floyyd_Warshall.cpp

@@ -1,3 +1,6 @@
+// Floyd-Warshall is an all-pairs shortest path algorithm. It computes the shortest paths between all pairs of vertices in a weighted graph, including negative weight edges.
+
+
 #include <iostream>
 #include <vector>
 #include <climits>

Graph_Algorithms/Kruskal.cpp

@@ -1,3 +1,6 @@
+
+//Kruskal's algorithm is used to find the Minimum Spanning Tree (MST) of a connected, undirected graph. It does this by selecting edges with the smallest weight while avoiding cycles.
+
 #include <iostream>
 #include <vector>
 #include <algorithm>

Graph_Algorithms/Prims_Algo.cpp

@@ -1,3 +1,6 @@
+
+//Prim's algorithm is another approach to find the Minimum Spanning Tree (MST). It starts with an arbitrary vertex and grows the MST one vertex at a time by selecting the edge with the minimum weight.
+
 #include <iostream>
 #include <vector>
 #include <queue>