Small Tweaks/Fixes (TheAlgorithms#235)

ruppysuppy · web-flow · commit df58a7ed5f8f · 2020-08-01T09:11:19.000+05:30
diff --git a/Graphs/ConnectedComponents.js b/Graphs/ConnectedComponents.js
@@ -1,4 +1,4 @@
-class GraphUnweightedUndirected {
+class GraphUnweightedUndirectedAdjacencyList {
   // Unweighted Undirected Graph class
   constructor () {
     this.connections = {}
@@ -46,7 +46,7 @@ class GraphUnweightedUndirected {
 }
 
 function main () {
-  const graph = new GraphUnweightedUndirected()
+  const graph = new GraphUnweightedUndirectedAdjacencyList()
   graph.addEdge(1, 2) // Component 1
   graph.addEdge(3, 4) // Component 2
   graph.addEdge(3, 5) // Component 2
diff --git a/Graphs/PrimMST.js b/Graphs/PrimMST.js
@@ -163,7 +163,7 @@ class GraphWeightedUndirectedAdjacencyList {
   }
 
   PrimMST (start) {
-    // Kruskal's Algorithm to generate a Minimum Spanning Tree (MST) of a graph
+    // Prim's Algorithm to generate a Minimum Spanning Tree (MST) of a graph
     // Details: https://en.wikipedia.org/wiki/Prim%27s_algorithm
     const distance = {}
     const parent = {}

Original file line number	Diff line number	Diff line change
`@@ -163,7 +163,7 @@ class GraphWeightedUndirectedAdjacencyList {`
`163`	`163`	`}`
`164`	`164`
`165`	`165`	`PrimMST (start) {`
`166`		`- // Kruskal's Algorithm to generate a Minimum Spanning Tree (MST) of a graph`
	`166`	`+ // Prim's Algorithm to generate a Minimum Spanning Tree (MST) of a graph`
`167`	`167`	`// Details: https://en.wikipedia.org/wiki/Prim%27s_algorithm`
`168`	`168`	`const distance = {}`
`169`	`169`	`const parent = {}`