diff --git a/Headers/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h b/Headers/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h new file mode 100644 index 0000000..2c509c9 --- /dev/null +++ b/Headers/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h @@ -0,0 +1,44 @@ +#pragma once + +#include +#include +using namespace std; + +namespace SingleSourceShortestPathBellmanFord +{ + class Node + { + public: + int data; + int distance; + Node* parent; + Node(int data); + }; + + class Edge + { + public: + Node* nodeU; + Node* nodeV; + int weight; + Edge(Node* nodeU, Node* nodeV, int weight); + }; + + class Graph + { + private: + map> _adjlist; + map _nodeMap; + vector _edgeList; + Node* MakeOrFindNode(int data); + void InitializeSingleSource(Node* sourceNode); + void Relax(Edge* edge); + void GetShortestPath(Node* node, vector& path); + + + public: + void PushDirectedEdge(int valueU, int valueV, int weight); + bool FindSingleSourceShortestPathBellmanFord(int data); + vector GetShortestPathBellmanFord(int data); + }; +} \ No newline at end of file diff --git a/Headers/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h b/Headers/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h new file mode 100644 index 0000000..37f6610 --- /dev/null +++ b/Headers/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h @@ -0,0 +1,51 @@ +#pragma once + +#include +#include +#include +using namespace std; + +namespace DirectedAcyclicGraphShortestPath +{ + enum color {WHITE, GRAY, BLACK}; + + class Node + { + public: + int data; + int color; + int distance; + Node* parent; + Node(int data); + }; + + class Edge + { + public: + Node* nodeU; + Node* nodeV; + int weight; + Edge(Node* nodeU, Node* nodeV, int weight); + }; + + class Graph + { + private: + map> _adjlist; + map _nodeMap; + map> _edgeMap; + list _topologicalSortedNodeList; + Node* MakeOrFindNode(int data); + void DepthFirstSearch(Node* node); + void TopologicalSort(); + void InitializeSingleSource(Node* sourceNode); + void Relax(Edge* edge); + void GetShortestPath(Node* node, vector& path); + + + public: + void PushDirectedEdge(int valueU, int valueV, int weight); + void FindDAGShortestPath(int data); + vector GetDAGShortestPath(int data); + }; +} \ No newline at end of file diff --git a/Headers/0003_Graph/0011_SingleSourceShortestPathDijkstra.h b/Headers/0003_Graph/0011_SingleSourceShortestPathDijkstra.h new file mode 100644 index 0000000..c2eccfe --- /dev/null +++ b/Headers/0003_Graph/0011_SingleSourceShortestPathDijkstra.h @@ -0,0 +1,55 @@ +#pragma once + +#include +#include +#include +using namespace std; + +namespace SingleSourceShortestPathDijkstra +{ + class Node + { + public: + int data; + int distance; + Node* parent; + Node(int data); + }; + + class Edge + { + public: + Node* nodeU; + Node* nodeV; + int weight; + Edge(Node* nodeU, Node* nodeV, int weight); + }; + + class CompareNodeDistance + { + public: + bool operator()(const Node* nodeU, const Node* nodeV) const + { + return nodeU->distance < nodeV->distance; + } + }; + + class Graph + { + private: + map> _adjlist; + map _nodeMap; + map> _edgeMap; + multiset _operationalSet; + Node* MakeOrFindNode(int data); + void InitializeSingleSource(Node* sourceNode); + void Relax(Edge* edge); + void Dijkstra(Node* source); + void GetShortestPath(Node* node, vector& path); + + public: + void PushDirectedEdge(int valueU, int valueV, int weight); + void FindShortestPathDijkstra(int data); + vector GetDijkstraShortestPath(int data); + }; +} \ No newline at end of file diff --git a/Headers/0003_Graph/0012_DifferenceConstraintsShortestPaths.h b/Headers/0003_Graph/0012_DifferenceConstraintsShortestPaths.h new file mode 100644 index 0000000..683dfa2 --- /dev/null +++ b/Headers/0003_Graph/0012_DifferenceConstraintsShortestPaths.h @@ -0,0 +1,43 @@ +#pragma once + +#include +#include +#include +using namespace std; + +namespace DifferenceConstraintsShortestPaths +{ + class Node + { + public: + string data; + int distance; + Node(string data); + }; + + class Edge + { + public: + Node* nodeU; + Node* nodeV; + int weight; + Edge(Node* nodeU, Node* nodeV, int weight); + }; + + class Graph + { + private: + map> _adjlist; + map _nodeMap; + vector _edgeList; + Node* MakeOrFindNode(string data); + void PushDirectedEdge(string valueU, string valueV, int weight); + void InitializeSingleSource(Node* sourceNode); + void Relax(Edge* edge); + + public: + void PushAllDirectedEdges(vector> vectorA, vector vectorX, vector vectorB); + bool FindDifferenceConstraintsSolutionBellmanFord(); + vector> GetDifferenceConstrtaintsSolution(); + }; +} \ No newline at end of file diff --git a/SourceCodes/0003_Graph/0003_TopologicalSort.cc b/SourceCodes/0003_Graph/0003_TopologicalSort.cc index 18dd52a..526456c 100644 --- a/SourceCodes/0003_Graph/0003_TopologicalSort.cc +++ b/SourceCodes/0003_Graph/0003_TopologicalSort.cc @@ -36,7 +36,7 @@ namespace TopologicalSort this->time++; nodeU->discoveryTime = this->time; nodeU->color = GRAY; - for (auto nodeV : this->_adjlist[nodeU]) + for (auto& nodeV : this->_adjlist[nodeU]) { if (nodeV->color == WHITE) { diff --git a/SourceCodes/0003_Graph/0009_SingleSourceShortestPathBellmanFord.cc b/SourceCodes/0003_Graph/0009_SingleSourceShortestPathBellmanFord.cc new file mode 100644 index 0000000..5d2decf --- /dev/null +++ b/SourceCodes/0003_Graph/0009_SingleSourceShortestPathBellmanFord.cc @@ -0,0 +1,108 @@ +#include "../Headers/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h" +#include +#include +using namespace std; + +namespace SingleSourceShortestPathBellmanFord +{ + Node::Node(int data) + { + this->data = data; + this->distance = INT_MAX; + this->parent = nullptr; + } + + Edge::Edge(Node* nodeU, Node* nodeV, int weight) + { + this->nodeU = nodeU; + this->nodeV = nodeV; + this->weight = weight; + } + + // Graph Private Member Methods + Node* Graph::MakeOrFindNode(int data) + { + Node* node = nullptr; + if (this->_nodeMap.find(data) == this->_nodeMap.end()) + { + node = new Node(data); + this->_nodeMap[data] = node; + } + else + { + node = this->_nodeMap[data]; + } + return node; + } + + void Graph :: InitializeSingleSource(Node* sourceNode) + { + for (auto& iterator : this->_nodeMap) + { + iterator.second->distance = INT_MAX; + iterator.second->parent = nullptr; + } + sourceNode->distance = 0; + } + + void Graph::Relax(Edge* edge) + { + if (edge->nodeU->distance != INT_MAX && (edge->nodeV->distance > (edge->nodeU->distance + edge->weight))) + { + edge->nodeV->distance = edge->nodeU->distance + edge->weight; + edge->nodeV->parent = edge->nodeU; + } + } + + void Graph::GetShortestPath(Node* node, vector& path) + { + path.push_back(node->data); + if (node->parent != nullptr) + { + this->GetShortestPath(node->parent, path); + } + } + + // Graph Public Member Methods + void Graph::PushDirectedEdge(int dataU, int dataV, int weight) + { + Node* nodeU = this->MakeOrFindNode(dataU); + Node* nodeV = this->MakeOrFindNode(dataV); + + this->_adjlist[nodeU].push_back(nodeV); + this->_edgeList.push_back(new Edge(nodeU, nodeV, weight)); + } + + bool Graph::FindSingleSourceShortestPathBellmanFord(int data) + { + Node* source = this->_nodeMap[data]; + + this->InitializeSingleSource(source); + + for (int i = 0; i < this->_nodeMap.size() - 1; i++) + { + for (auto& edge : this->_edgeList) + { + this->Relax(edge); + } + } + + for (auto& edge : this->_edgeList) + { + if (edge->nodeV->distance > (edge->nodeU->distance + edge->weight)) + { + return false; + } + } + return true; + } + + vector Graph::GetShortestPathBellmanFord(int data) + { + vector path = {}; + Node* node = this->_nodeMap[data]; + this->GetShortestPath(node, path); + reverse(path.begin(), path.end()); + return path; + } +} \ No newline at end of file diff --git a/SourceCodes/0003_Graph/0010_DirectedAcyclicGraphShortestPath.cc b/SourceCodes/0003_Graph/0010_DirectedAcyclicGraphShortestPath.cc new file mode 100644 index 0000000..da683fb --- /dev/null +++ b/SourceCodes/0003_Graph/0010_DirectedAcyclicGraphShortestPath.cc @@ -0,0 +1,124 @@ +#include "../Headers/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h" +#include +#include +using namespace std; + +namespace DirectedAcyclicGraphShortestPath +{ + Node::Node(int data) + { + this->data = data; + this->color = WHITE; + this->distance = INT_MAX; + this->parent = nullptr; + } + + Edge::Edge(Node* nodeU, Node* nodeV, int weight) + { + this->nodeU = nodeU; + this->nodeV = nodeV; + this->weight = weight; + } + + // Graph Private Member Methods + Node* Graph::MakeOrFindNode(int data) + { + Node* node = nullptr; + if (this->_nodeMap.find(data) == this->_nodeMap.end()) + { + node = new Node(data); + this->_nodeMap[data] = node; + } + else + { + node = this->_nodeMap[data]; + } + return node; + } + + void Graph::DepthFirstSearch(Node* nodeU) + { + nodeU->color = GRAY; + for (auto& nodeV : this->_adjlist[nodeU]) + { + if (nodeV->color == WHITE) + { + this->DepthFirstSearch(nodeV); + } + } + nodeU->color = BLACK; + this->_topologicalSortedNodeList.push_front(nodeU); + } + + void Graph::TopologicalSort() + { + for (auto& iterator : this->_nodeMap) + { + if (iterator.second->color == WHITE) + { + this->DepthFirstSearch(iterator.second); + } + } + } + + void Graph::InitializeSingleSource(Node* sourceNode) + { + for (auto& iterator : this->_nodeMap) + { + iterator.second->distance = INT_MAX; + iterator.second->parent = nullptr; + } + sourceNode->distance = 0; + } + + void Graph::Relax(Edge* edge) + { + if (edge->nodeU->distance != INT_MAX && (edge->nodeV->distance > (edge->nodeU->distance + edge->weight))) + { + edge->nodeV->distance = edge->nodeU->distance + edge->weight; + edge->nodeV->parent = edge->nodeU; + } + } + + void Graph::GetShortestPath(Node* node, vector& path) + { + path.push_back(node->data); + if (node->parent != nullptr) + { + this->GetShortestPath(node->parent, path); + } + } + + // Graph Public Member Methods + void Graph::PushDirectedEdge(int dataU, int dataV, int weight) + { + Node* nodeU = this->MakeOrFindNode(dataU); + Node* nodeV = this->MakeOrFindNode(dataV); + + this->_adjlist[nodeU].push_back(nodeV); + this->_edgeMap[nodeU].push_back(new Edge(nodeU, nodeV, weight)); + } + + void Graph::FindDAGShortestPath(int data) + { + this->TopologicalSort(); + Node* source = this->_nodeMap[data]; + this->InitializeSingleSource(source); + for (auto& node : this->_topologicalSortedNodeList) + { + for (auto& edge : this->_edgeMap[node]) + { + this->Relax(edge); + } + } + } + + vector Graph::GetDAGShortestPath(int data) + { + vector path = {}; + Node* node = this->_nodeMap[data]; + this->GetShortestPath(node, path); + reverse(path.begin(), path.end()); + return path; + } +} \ No newline at end of file diff --git a/SourceCodes/0003_Graph/0011_SingleSourceShortestPathDijkstra.cc b/SourceCodes/0003_Graph/0011_SingleSourceShortestPathDijkstra.cc new file mode 100644 index 0000000..138899f --- /dev/null +++ b/SourceCodes/0003_Graph/0011_SingleSourceShortestPathDijkstra.cc @@ -0,0 +1,113 @@ +#include "../Headers/0003_Graph/0011_SingleSourceShortestPathDijkstra.h" +#include +#include +using namespace std; + +namespace SingleSourceShortestPathDijkstra +{ + Node::Node(int data) + { + this->data = data; + this->distance = INT_MAX; + this->parent = nullptr; + } + + Edge::Edge(Node* nodeU, Node* nodeV, int weight) + { + this->nodeU = nodeU; + this->nodeV = nodeV; + this->weight = weight; + } + + // Graph Private Member Methods + Node* Graph::MakeOrFindNode(int data) + { + Node* node = nullptr; + if (this->_nodeMap.find(data) == this->_nodeMap.end()) + { + node = new Node(data); + this->_nodeMap[data] = node; + } + else + { + node = this->_nodeMap[data]; + } + return node; + } + + void Graph::InitializeSingleSource(Node* sourceNode) + { + for (auto& iterator : this->_nodeMap) + { + iterator.second->distance = INT_MAX; + iterator.second->parent = nullptr; + } + sourceNode->distance = 0; + } + + void Graph::Relax(Edge* edge) + { + if (edge->nodeU->distance != INT_MAX && (edge->nodeV->distance > (edge->nodeU->distance + edge->weight))) + { + this->_operationalSet.erase(edge->nodeV); + edge->nodeV->distance = edge->nodeU->distance + edge->weight; + edge->nodeV->parent = edge->nodeU; + this->_operationalSet.insert(edge->nodeV); + } + } + + void Graph::Dijkstra(Node* source) + { + this->InitializeSingleSource(source); + + for (auto& node : this->_nodeMap) + { + this->_operationalSet.insert(node.second); + } + + while (!this->_operationalSet.empty()) + { + Node* nodeU = *(this->_operationalSet.begin()); + this->_operationalSet.erase(nodeU); + + for (auto& edge : this->_edgeMap[nodeU]) + { + this->Relax(edge); + } + } + } + + void Graph::GetShortestPath(Node* node, vector& path) + { + path.push_back(node->data); + if (node->parent != nullptr) + { + this->GetShortestPath(node->parent, path); + } + } + + // Graph Public Member Methods + void Graph::PushDirectedEdge(int dataU, int dataV, int weight) + { + Node* nodeU = this->MakeOrFindNode(dataU); + Node* nodeV = this->MakeOrFindNode(dataV); + + this->_adjlist[nodeU].push_back(nodeV); + this->_edgeMap[nodeU].push_back(new Edge(nodeU, nodeV, weight)); + } + + void Graph::FindShortestPathDijkstra(int data) + { + Node* source = this->_nodeMap[data]; + this->Dijkstra(source); + } + + vector Graph::GetDijkstraShortestPath(int data) + { + vector path = {}; + Node* node = this->_nodeMap[data]; + this->GetShortestPath(node, path); + reverse(path.begin(), path.end()); + return path; + } +} \ No newline at end of file diff --git a/SourceCodes/0003_Graph/0012_DifferenceConstraintsShortestPaths.cc b/SourceCodes/0003_Graph/0012_DifferenceConstraintsShortestPaths.cc new file mode 100644 index 0000000..20b7784 --- /dev/null +++ b/SourceCodes/0003_Graph/0012_DifferenceConstraintsShortestPaths.cc @@ -0,0 +1,133 @@ +#include"../Headers/0003_Graph/0012_DifferenceConstraintsShortestPaths.h" +#include +using namespace std; + +namespace DifferenceConstraintsShortestPaths +{ + Node::Node(string data) + { + this->data = data; + this->distance = INT_MAX; + } + + Edge::Edge(Node* nodeU, Node* nodeV, int weight) + { + this->nodeU = nodeU; + this->nodeV = nodeV; + this->weight = weight; + } + + // Graph Private Member Methods + Node* Graph::MakeOrFindNode(string data) + { + Node* node = nullptr; + if (this->_nodeMap.find(data) == this->_nodeMap.end()) + { + node = new Node(data); + this->_nodeMap[data] = node; + } + else + { + node = this->_nodeMap[data]; + } + return node; + } + + void Graph::PushDirectedEdge(string dataU, string dataV, int weight) + { + Node* nodeU = this->MakeOrFindNode(dataU); + Node* nodeV = this->MakeOrFindNode(dataV); + + this->_adjlist[nodeU].push_back(nodeV); + this->_edgeList.push_back(new Edge(nodeU, nodeV, weight)); + } + + void Graph::InitializeSingleSource(Node* sourceNode) + { + for (auto& iterator : this->_nodeMap) + { + iterator.second->distance = INT_MAX; + } + sourceNode->distance = 0; + } + + void Graph::Relax(Edge* edge) + { + if (edge->nodeU->distance != INT_MAX && (edge->nodeV->distance > (edge->nodeU->distance + edge->weight))) + { + edge->nodeV->distance = edge->nodeU->distance + edge->weight; + } + } + + // Graph Public Member Methods + void Graph::PushAllDirectedEdges(vector> vectorA, vector vectorX, vector vectorB) + { + // Creating the Actual Graph + string valueU = ""; + string valueV = ""; + int weight = 0; + for (int i = 0; i < vectorA.size(); i++) + { + for (int j = 0; j < vectorX.size(); j++) + { + if (vectorA[i][j] == 1) + { + valueV= vectorX[j]; + } + if (vectorA[i][j] == -1) + { + valueU = vectorX[j]; + } + } + weight = vectorB[i]; + this->PushDirectedEdge(valueU, valueV, weight); + } + + // Creating all the edges from the additional vertex + valueU = ""; + valueV = ""; + weight = 0; + for (int i = 0; i < vectorX.size(); i++) + { + valueV = vectorX[i]; + this->PushDirectedEdge(valueU, valueV, weight); + } + } + + bool Graph::FindDifferenceConstraintsSolutionBellmanFord() + { + Node* source = this->_nodeMap[""]; + + this->InitializeSingleSource(source); + + for (int i = 0; i < this->_nodeMap.size(); i++) + { + for (auto& edge : this->_edgeList) + { + this->Relax(edge); + } + } + + for (auto& edge : this->_edgeList) + { + if (edge->nodeV->distance > (edge->nodeU->distance + edge->weight)) + { + return false; + } + } + return true; + } + + vector> Graph::GetDifferenceConstrtaintsSolution() + { + vector> result; + for (auto& node : this->_nodeMap) + { + if (node.second->data != "") + { + result.push_back({ node.second->data, node.second->distance }); + } + } + return result; + } +} \ No newline at end of file diff --git a/SourceCodes/0003_Graph/CMakeLists.txt b/SourceCodes/0003_Graph/CMakeLists.txt index 0837512..d2171df 100644 --- a/SourceCodes/0003_Graph/CMakeLists.txt +++ b/SourceCodes/0003_Graph/CMakeLists.txt @@ -8,6 +8,10 @@ set(0003GRAPH_SOURCES 0006_EulerianPathAndCircuit.cc 0007_MinimumSpanningTreeKruskalAlgorithm.cc 0008_MinimumSpanningTreePrimAlgorithm.cc + 0009_SingleSourceShortestPathBellmanFord.cc + 0010_DirectedAcyclicGraphShortestPath.cc + 0011_SingleSourceShortestPathDijkstra.cc + 0012_DifferenceConstraintsShortestPaths.cc ) diff --git a/Tests/0000_CommonUtilities/UnitTestHelper.h b/Tests/0000_CommonUtilities/UnitTestHelper.h index c903d36..6e3509e 100644 --- a/Tests/0000_CommonUtilities/UnitTestHelper.h +++ b/Tests/0000_CommonUtilities/UnitTestHelper.h @@ -73,7 +73,6 @@ class UnitTestHelper return result; } - // This helper method is used to sort the vector of vectors of a particular typename. // Each inner vector is sorted first. // Then each of them are sorted by their first element, in increasing order. @@ -109,7 +108,7 @@ class UnitTestHelper } template - bool NormalizeCyclesAnCompare(vector data1, vector data2) + bool NormalizeCyclesAndCompare(vector data1, vector data2) { if (data1.size() != data2.size()) { @@ -158,4 +157,27 @@ class UnitTestHelper }); return data; } + + template + string SortVectorOfPairAndSerialize(vector> data) + { + // Sorting the vector in non-decreasing order on typename T1 + sort(data.begin(), data.end(), [](const pair& pair1, const pair& pair2) + { + return pair1.first < pair2.first; + }); + + // Serializing the vector to string + string result = ""; + for (auto& iterator : data) + { + result += iterator.first + "(" + to_string(iterator.second) + ")" + " "; + } + + if (!result.empty()) + { + result.pop_back(); + } + return result; + } }; \ No newline at end of file diff --git a/Tests/0003_Graph/0005_HamiltonianPathAndCycleTest.cc b/Tests/0003_Graph/0005_HamiltonianPathAndCycleTest.cc index 386825d..d46a651 100644 --- a/Tests/0003_Graph/0005_HamiltonianPathAndCycleTest.cc +++ b/Tests/0003_Graph/0005_HamiltonianPathAndCycleTest.cc @@ -28,6 +28,6 @@ namespace HamiltonianPathAndCycle ASSERT_TRUE(isHamiltonianCyclePresent); ASSERT_TRUE(isHamiltonianPathPresent); - ASSERT_TRUE(unitTestHelper.NormalizeCyclesAnCompare(hamiltonianPathActualResult, hamiltonianPathExpectedResult)); + ASSERT_TRUE(unitTestHelper.NormalizeCyclesAndCompare(hamiltonianPathActualResult, hamiltonianPathExpectedResult)); } } \ No newline at end of file diff --git a/Tests/0003_Graph/0009_SingleSourceShortestPathBellmanFordTest.cc b/Tests/0003_Graph/0009_SingleSourceShortestPathBellmanFordTest.cc new file mode 100644 index 0000000..f6bc452 --- /dev/null +++ b/Tests/0003_Graph/0009_SingleSourceShortestPathBellmanFordTest.cc @@ -0,0 +1,104 @@ +#include +#include "../Headers/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h" +#include "../0000_CommonUtilities/UnitTestHelper.h" + +namespace SingleSourceShortestPathBellmanFord +{ + UnitTestHelper unitTestHelper; + + // Test for Simple Graph + TEST(BellmanFordTest, SimpleTest) + { + Graph graph; + + graph.PushDirectedEdge(0, 1, 6); + graph.PushDirectedEdge(0, 3, 7); + graph.PushDirectedEdge(1, 2, 5); + graph.PushDirectedEdge(1, 3, 8); + graph.PushDirectedEdge(1, 4, -4); + graph.PushDirectedEdge(2, 1, -2); + graph.PushDirectedEdge(3, 2, -3); + graph.PushDirectedEdge(3, 4, 9); + graph.PushDirectedEdge(3, 4, 9); + graph.PushDirectedEdge(4, 2, 7); + graph.PushDirectedEdge(4, 0, 2); + + string expectedResult = "0 3 2 1 4"; + ASSERT_TRUE(graph.FindSingleSourceShortestPathBellmanFord(0)); + ASSERT_EQ(unitTestHelper.SerializeVectorToString(graph.GetShortestPathBellmanFord(4)), expectedResult); + } + + // Test for Single Node Graph + TEST(BellmanFordTest, SingleNodeTest) + { + Graph graph; + graph.PushDirectedEdge(0, 0, 0); // Self-loop + + string expectedResult = "0"; + ASSERT_TRUE(graph.FindSingleSourceShortestPathBellmanFord(0)); + ASSERT_EQ(unitTestHelper.SerializeVectorToString(graph.GetShortestPathBellmanFord(0)), expectedResult); + } + + // Test for Negative Weight Cycle + TEST(BellmanFordTest, NegativeWeightCycleTest) + { + Graph graph; + graph.PushDirectedEdge(0, 1, 1); + graph.PushDirectedEdge(1, 2, -1); + graph.PushDirectedEdge(2, 0, -1); // Negative weight cycle + + ASSERT_FALSE(graph.FindSingleSourceShortestPathBellmanFord(0)); + } + + // Test for Multiple Shortest Paths + TEST(BellmanFordTest, MultipleShortestPathsTest) + { + Graph graph; + graph.PushDirectedEdge(0, 1, 5); + graph.PushDirectedEdge(0, 2, 5); + graph.PushDirectedEdge(1, 3, 1); + graph.PushDirectedEdge(2, 3, 1); + + string expectedResult = "0 1 3"; + ASSERT_TRUE(graph.FindSingleSourceShortestPathBellmanFord(0)); + ASSERT_EQ(unitTestHelper.SerializeVectorToString(graph.GetShortestPathBellmanFord(3)), expectedResult); + } + + // Test for All Negative Weights + TEST(BellmanFordTest, AllNegativeWeightsTest) + { + Graph graph; + graph.PushDirectedEdge(0, 1, -5); + graph.PushDirectedEdge(1, 2, -3); + graph.PushDirectedEdge(2, 3, -2); + graph.PushDirectedEdge(3, 4, -1); + + string expectedResult = "0 1 2 3 4"; + ASSERT_TRUE(graph.FindSingleSourceShortestPathBellmanFord(0)); + ASSERT_EQ(unitTestHelper.SerializeVectorToString(graph.GetShortestPathBellmanFord(4)), expectedResult); + } + + // Test for Large Graph + TEST(BellmanFordTest, LargeGraphTest) + { + Graph graph; + for (int i = 0; i < 100; ++i) { + graph.PushDirectedEdge(i, i + 1, 1); + } + + string expectedResult = "0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20"; + ASSERT_TRUE(graph.FindSingleSourceShortestPathBellmanFord(0)); + ASSERT_EQ(unitTestHelper.SerializeVectorToString(graph.GetShortestPathBellmanFord(20)), expectedResult); + } + + // Test for Self-Loop Edge + TEST(BellmanFordTest, SelfLoopTest) + { + Graph graph; + graph.PushDirectedEdge(0, 0, 10); // Self-loop with weight 10 + + string expectedResult = "0"; + ASSERT_TRUE(graph.FindSingleSourceShortestPathBellmanFord(0)); + ASSERT_EQ(unitTestHelper.SerializeVectorToString(graph.GetShortestPathBellmanFord(0)), expectedResult); + } +} diff --git a/Tests/0003_Graph/0010_DirectedAcyclicGraphShortestPathTest.cc b/Tests/0003_Graph/0010_DirectedAcyclicGraphShortestPathTest.cc new file mode 100644 index 0000000..3a59445 --- /dev/null +++ b/Tests/0003_Graph/0010_DirectedAcyclicGraphShortestPathTest.cc @@ -0,0 +1,29 @@ +#include +#include "../Headers/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h" +#include "../0000_CommonUtilities/UnitTestHelper.h" + +namespace DirectedAcyclicGraphShortestPath +{ + UnitTestHelper unitTestHelper; + + // Test for Simple Graph + TEST(DAGTest, SimpleGraph) + { + Graph graph; + + graph.PushDirectedEdge(0, 1, 5); + graph.PushDirectedEdge(0, 2, 3); + graph.PushDirectedEdge(1, 2, 2); + graph.PushDirectedEdge(1, 3, 6); + graph.PushDirectedEdge(2, 3, 7); + graph.PushDirectedEdge(2, 4, 4); + graph.PushDirectedEdge(2, 5, 2); + graph.PushDirectedEdge(3, 4, -1); + graph.PushDirectedEdge(3, 5, 1); + graph.PushDirectedEdge(4, 5, -2); + + graph.FindDAGShortestPath(1); + string expectedPath = "1 3 4 5"; + ASSERT_EQ(unitTestHelper.SerializeVectorToString(graph.GetDAGShortestPath(5)), expectedPath); + } +} \ No newline at end of file diff --git a/Tests/0003_Graph/0011_SingleSourceShortestPathDijkstraTest.cc b/Tests/0003_Graph/0011_SingleSourceShortestPathDijkstraTest.cc new file mode 100644 index 0000000..4f0be15 --- /dev/null +++ b/Tests/0003_Graph/0011_SingleSourceShortestPathDijkstraTest.cc @@ -0,0 +1,31 @@ +#include +#include "../Headers/0003_Graph/0011_SingleSourceShortestPathDijkstra.h" +#include "../0000_CommonUtilities/UnitTestHelper.h" + +namespace SingleSourceShortestPathDijkstra +{ + UnitTestHelper unitTestHelper; + + // Test for Simple Graph + TEST(DijkstraTest, SimpleGraph) + { + Graph graph; + + graph.PushDirectedEdge(0, 1, 10); + graph.PushDirectedEdge(0, 3, 5); + graph.PushDirectedEdge(1, 2, 1); + graph.PushDirectedEdge(1, 3, 2); + graph.PushDirectedEdge(2, 4, 4); + graph.PushDirectedEdge(3, 1, 3); + graph.PushDirectedEdge(3, 2, 9); + graph.PushDirectedEdge(3, 4, 2); + graph.PushDirectedEdge(4, 2, 6); + graph.PushDirectedEdge(4, 0, 7); + + graph.FindShortestPathDijkstra(0); + + string expectedPath = "0 3 1 2"; + + ASSERT_EQ(unitTestHelper.SerializeVectorToString(graph.GetDijkstraShortestPath(2)), expectedPath); + } +} \ No newline at end of file diff --git a/Tests/0003_Graph/0012_DifferenceConstraintsShortestPathsTest.cc b/Tests/0003_Graph/0012_DifferenceConstraintsShortestPathsTest.cc new file mode 100644 index 0000000..04b293e --- /dev/null +++ b/Tests/0003_Graph/0012_DifferenceConstraintsShortestPathsTest.cc @@ -0,0 +1,40 @@ +#include +#include"../Headers/0003_Graph/0012_DifferenceConstraintsShortestPaths.h" +#include"../0000_CommonUtilities/UnitTestHelper.h" +using namespace std; + +namespace DifferenceConstraintsShortestPaths +{ + UnitTestHelper unitTestHelper; + + TEST(DifferenceConstraints, SimpleGraph) + { + Graph graph; + + vector> vectorA = + { + {1, -1, 0, 0, 0}, + {1, 0, 0, 0, -1}, + {0, 1, 0, 0, -1}, + {-1, 0, 1, 0, 0}, + {-1, 0, 0, 1, 0}, + {0, 0, -1, 1, 0}, + {0, 0, -1, 0, 1}, + {0, 0, 0, -1, 1}, + }; + vector vectorX = { "v1", "v2", "v3", "v4", "v5" }; + vector vectorB = {0, -1, 1, 5, 4, -1, -3, -3}; + vector> expectedSolution = + { + {"v2", -3}, + {"v5", -4}, + {"v1", -5}, + {"v4", -1}, + {"v3", 0}, + }; + graph.PushAllDirectedEdges(vectorA, vectorX, vectorB); + + ASSERT_TRUE(graph.FindDifferenceConstraintsSolutionBellmanFord()); + ASSERT_EQ(unitTestHelper.SortVectorOfPairAndSerialize(graph.GetDifferenceConstrtaintsSolution()), unitTestHelper.SortVectorOfPairAndSerialize(expectedSolution)); + } +} \ No newline at end of file diff --git a/Tests/0003_Graph/CMakeLists.txt b/Tests/0003_Graph/CMakeLists.txt index b5e4144..1d024f1 100644 --- a/Tests/0003_Graph/CMakeLists.txt +++ b/Tests/0003_Graph/CMakeLists.txt @@ -20,6 +20,10 @@ add_executable( 0006_EulerianPathAndCircuitTest.cc 0007_MinimumSpanningTreeKruskalAlgorithmTest.cc 0008_MinimumSpanningTreePrimAlgorithmTest.cc + 0009_SingleSourceShortestPathBellmanFordTest.cc + 0010_DirectedAcyclicGraphShortestPathTest.cc + 0011_SingleSourceShortestPathDijkstraTest.cc + 0012_DifferenceConstraintsShortestPathsTest.cc ) target_link_libraries(