BFS graph class name changes

Debashis08 · Debashis08 · commit 02f1ecaf4e83 · 2024-10-08T00:59:15.000+05:30
diff --git a/Headers/0003_Graph/0001_BreadthFirstSearch.h b/Headers/0003_Graph/0001_BreadthFirstSearch.h
@@ -8,23 +8,23 @@
 using namespace std;
 enum color { WHITE, GRAY, BLACK };
 
-class Node
+class BFSNode
 {
 public:
     char data;
     int distance;
     int color;
-    Node* parent;
-    Node(char value);
+    BFSNode* parent;
+    BFSNode(char value);
 };
 
-class Graph
+class BFSGraph
 {
 private:
-    map<Node*, list<Node*>> _adjlist;
-    map<char, Node*> _nodeMap;
-    Node* MakeOrFindNode(char value);
-    void BreadthFirstSearch(Node* node);
+    map<BFSNode*, list<BFSNode*>> _adjlist;
+    map<char, BFSNode*> _nodeMap;
+    BFSNode* MakeOrFindNode(char value);
+    void BreadthFirstSearch(BFSNode* node);
 public:
     void PushUndirectedEdge(char valueU, char valueV);
     void BFS(char value);
diff --git a/SourceCodes/0003_Graph/0001_BreadthFirstSearch.cc b/SourceCodes/0003_Graph/0001_BreadthFirstSearch.cc
@@ -7,20 +7,20 @@
 #include<climits>
 using namespace std;
 
-Node::Node(char value)                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              
+BFSNode::BFSNode(char value)                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              
 {
 	this->data = value;
 	this->distance = INT_MAX;
 	this->color = WHITE;
 	this->parent = nullptr;
 }
 
-Node* Graph::MakeOrFindNode(char value)
+BFSNode* BFSGraph::MakeOrFindNode(char value)
 {
-	Node* node = nullptr;
+	BFSNode* node = nullptr;
 	if (this->_nodeMap.find(value) == this->_nodeMap.end())
 	{
-		node = new Node(value);
+		node = new BFSNode(value);
 		this->_nodeMap[value] = node;
 	}
 	else
@@ -30,18 +30,18 @@ Node* Graph::MakeOrFindNode(char value)
 	return node;
 }
 
-void Graph::BreadthFirstSearch(Node* node)
+void BFSGraph::BreadthFirstSearch(BFSNode* node)
 {
 	node->color = WHITE;
 	node->distance = 0;
 	node->parent = nullptr;
 
-	queue<Node*> nodeQueue;
+	queue<BFSNode*> nodeQueue;
 	nodeQueue.push(node);
 
 	while (nodeQueue.empty()!=true)
 	{
-		Node* currentNode = nodeQueue.front();
+		BFSNode* currentNode = nodeQueue.front();
 		nodeQueue.pop();
 
 		for (auto &adjacentNode : this->_adjlist[currentNode])
@@ -58,21 +58,21 @@ void Graph::BreadthFirstSearch(Node* node)
 	}
 }
 
-void Graph::PushUndirectedEdge(char valueU, char valueV)
+void BFSGraph::PushUndirectedEdge(char valueU, char valueV)
 {
-	Node* nodeU = this->MakeOrFindNode(valueU);
-	Node* nodeV = this->MakeOrFindNode(valueV);
+	BFSNode* nodeU = this->MakeOrFindNode(valueU);
+	BFSNode* nodeV = this->MakeOrFindNode(valueV);
 
 	this->_adjlist[nodeU].push_back(nodeV);
 	this->_adjlist[nodeV].push_back(nodeU);
 }
 
-void Graph::BFS(char value)
+void BFSGraph::BFS(char value)
 {
 	this->BreadthFirstSearch(this->_nodeMap[value]);
 }
 
-vector<pair<char, int>> Graph::ShowBFSResult()
+vector<pair<char, int>> BFSGraph::ShowBFSResult()
 {
 	vector<pair<char, int>> result;
 	for (auto& node : this->_nodeMap)
diff --git a/Tests/0003_Graph/0001_BreadthFirstSearchTest.cc b/Tests/0003_Graph/0001_BreadthFirstSearchTest.cc
@@ -9,7 +9,7 @@ namespace BreadthFirstSearchTest
 
 	TEST(BFSTesting, ShowBFSResultTest01) 
     {
-		Graph graph;
+		BFSGraph graph;
 
         graph.PushUndirectedEdge('s', 'r');
         graph.PushUndirectedEdge('s', 'w');
@@ -31,7 +31,7 @@ namespace BreadthFirstSearchTest
 
     TEST(BFSTesting, ShowBFSResultTest02) 
     {
-        Graph graph;
+        BFSGraph graph;
 
         graph.PushUndirectedEdge('s', 'r');
 

Original file line number	Diff line number	Diff line change
`@@ -7,20 +7,20 @@`
`7`	`7`	`#include<climits>`
`8`	`8`	`using namespace std;`
`9`	`9`
`10`		`-Node::Node(char value)`
	`10`	`+BFSNode::BFSNode(char value)`
`11`	`11`	`{`
`12`	`12`	`this->data = value;`
`13`	`13`	`this->distance = INT_MAX;`
`14`	`14`	`this->color = WHITE;`
`15`	`15`	`this->parent = nullptr;`
`16`	`16`	`}`
`17`	`17`
`18`		`-Node* Graph::MakeOrFindNode(char value)`
	`18`	`+BFSNode* BFSGraph::MakeOrFindNode(char value)`
`19`	`19`	`{`
`20`		`- Node* node = nullptr;`
	`20`	`+ BFSNode* node = nullptr;`
`21`	`21`	`if (this->_nodeMap.find(value) == this->_nodeMap.end())`
`22`	`22`	`{`
`23`		`- node = new Node(value);`
	`23`	`+ node = new BFSNode(value);`
`24`	`24`	`this->_nodeMap[value] = node;`
`25`	`25`	`}`
`26`	`26`	`else`
`@@ -30,18 +30,18 @@ Node* Graph::MakeOrFindNode(char value)`
`30`	`30`	`return node;`
`31`	`31`	`}`
`32`	`32`
`33`		`-void Graph::BreadthFirstSearch(Node* node)`
	`33`	`+void BFSGraph::BreadthFirstSearch(BFSNode* node)`
`34`	`34`	`{`
`35`	`35`	`node->color = WHITE;`
`36`	`36`	`node->distance = 0;`
`37`	`37`	`node->parent = nullptr;`
`38`	`38`
`39`		`- queue<Node*> nodeQueue;`
	`39`	`+ queue<BFSNode*> nodeQueue;`
`40`	`40`	`nodeQueue.push(node);`
`41`	`41`
`42`	`42`	`while (nodeQueue.empty()!=true)`
`43`	`43`	`{`
`44`		`- Node* currentNode = nodeQueue.front();`
	`44`	`+ BFSNode* currentNode = nodeQueue.front();`
`45`	`45`	`nodeQueue.pop();`
`46`	`46`
`47`	`47`	`for (auto &adjacentNode : this->_adjlist[currentNode])`
`@@ -58,21 +58,21 @@ void Graph::BreadthFirstSearch(Node* node)`
`58`	`58`	`}`
`59`	`59`	`}`
`60`	`60`
`61`		`-void Graph::PushUndirectedEdge(char valueU, char valueV)`
	`61`	`+void BFSGraph::PushUndirectedEdge(char valueU, char valueV)`
`62`	`62`	`{`
`63`		`- Node* nodeU = this->MakeOrFindNode(valueU);`
`64`		`- Node* nodeV = this->MakeOrFindNode(valueV);`
	`63`	`+ BFSNode* nodeU = this->MakeOrFindNode(valueU);`
	`64`	`+ BFSNode* nodeV = this->MakeOrFindNode(valueV);`
`65`	`65`
`66`	`66`	`this->_adjlist[nodeU].push_back(nodeV);`
`67`	`67`	`this->_adjlist[nodeV].push_back(nodeU);`
`68`	`68`	`}`
`69`	`69`
`70`		`-void Graph::BFS(char value)`
	`70`	`+void BFSGraph::BFS(char value)`
`71`	`71`	`{`
`72`	`72`	`this->BreadthFirstSearch(this->_nodeMap[value]);`
`73`	`73`	`}`
`74`	`74`
`75`		`-vector<pair<char, int>> Graph::ShowBFSResult()`
	`75`	`+vector<pair<char, int>> BFSGraph::ShowBFSResult()`
`76`	`76`	`{`
`77`	`77`	`vector<pair<char, int>> result;`
`78`	`78`	`for (auto& node : this->_nodeMap)`
Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@ namespace BreadthFirstSearchTest`
`9`	`9`
`10`	`10`	`TEST(BFSTesting, ShowBFSResultTest01)`
`11`	`11`	`{`
`12`		`- Graph graph;`
	`12`	`+ BFSGraph graph;`
`13`	`13`
`14`	`14`	`graph.PushUndirectedEdge('s', 'r');`
`15`	`15`	`graph.PushUndirectedEdge('s', 'w');`
`@@ -31,7 +31,7 @@ namespace BreadthFirstSearchTest`
`31`	`31`
`32`	`32`	`TEST(BFSTesting, ShowBFSResultTest02)`
`33`	`33`	`{`
`34`		`- Graph graph;`
	`34`	`+ BFSGraph graph;`
`35`	`35`
`36`	`36`	`graph.PushUndirectedEdge('s', 'r');`
`37`	`37`