feature: ham cycle initial draft

Initial code commit for Hamiltonian Cycle finding

Author: Debashis08

Headers/0003_Graph/0005_HamiltonianPathAndCycle.h

@@ -0,0 +1,28 @@
+#pragma once
+
+#include<map>
+#include<list>
+#include<vector>
+using namespace std;
+
+class HamiltonianNode
+{
+public:
+	int data;
+	bool isVisited;
+	HamiltonianNode(int value);
+};
+
+class HamiltonianGraph
+{
+private:
+	bool isHamiltonianCyclePresent;
+	bool isHamiltonianPathPresent;
+	map<HamiltonianNode*, list<HamiltonianNode*>> _adjlist;
+	map<int, HamiltonianNode*> _nodeMap;
+	HamiltonianNode* MakeOrFindNode(int value);
+
+public:
+	void PushUndirectedEdge(int valueU, int valueV);
+	void PushSingleNode(int valueU);
+};

SourceCodes/0003_Graph/0005_HamiltonianPathAndCycle.cc

@@ -4,6 +4,7 @@ set(0003GRAPH_SOURCES
     0002_DepthFirstSearch.cc
     0003_TopologicalSort.cc
     0004_StronglyConnectedComponents.cc
+    0005_HamiltonianPathAndCycle.cc
 )
 
 # Create a library target

SourceCodes/0003_Graph/CMakeLists.txt

@@ -16,6 +16,7 @@ add_executable(
   0002_DepthFirstSearchTest.cc
   0003_TopologicalSortTest.cc
   0004_StronglyConnectedComponentsTest.cc
+  0005_HamiltonianPathAndCycleTest.cc
 )
 
 target_link_libraries(