From df58a7ed5f8fd12d764e2eb633f68e3aea91eb66 Mon Sep 17 00:00:00 2001
From: Tapajyoti Bose <44058757+ruppysuppy@users.noreply.github.com>
Date: Sat, 1 Aug 2020 09:11:19 +0530
Subject: [PATCH] Small Tweaks/Fixes (#235)

---
 Graphs/ConnectedComponents.js | 4 ++--
 Graphs/PrimMST.js             | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Graphs/ConnectedComponents.js b/Graphs/ConnectedComponents.js
index 2333a545c..842a2eedc 100644
--- 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
index d38c0f00b..be1e18c0d 100644
--- 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 = {}