Update README.md

arnab132 · web-flow · commit e5680c8ea8ee · 2023-03-05T13:03:59.000+05:30
diff --git a/README.md b/README.md
@@ -6,7 +6,7 @@ A group of edges that connects two Set of vertices in a graph is called cut in g
 
 How does Prim’s Algorithm Work? 
 
-The idea behind Prim’s algorithm is simple, a Spanning Tree means all vertices must be connected. So the two disjoint subsets (discussed above) of vertices must be connected to make a Spanning Tree. And they must be connected with the minimum weight edge to make it a Minimum Spanning Tree (MST). 
+The idea behind Prim’s algorithm is simple, a Spanning Tree means all vertices must be connected. So the two disjoint subsets (discussed above) of vertices must be connected to make a spanning tree. And they must be connected with the minimum weight edge to make it a Minimum Spanning Tree (MST). 
 
 Algorithm :
 
