Debashis08 · Debashis08 · Jun 24, 2025 · Jun 22, 2025 · Jun 22, 2025 · Jun 22, 2025
diff --git a/.clang-tidy b/.clang-tidy
@@ -3,7 +3,7 @@ Checks: >
 
 WarningsAsErrors: '*'
 
-HeaderFilterRegex: '(Headers/.*|SourceCodes/.*)'
+HeaderFilterRegex: '(include/.*|source/.*)'
 
 CheckOptions:
   # Private member variables
@@ -24,4 +24,4 @@ CheckOptions:
   - key: readability-identifier-naming.IgnoreFailures
     value: false
   - key: readability-identifier-naming.IgnoreFailedSplit
-    value: false
+    value: false
diff --git a/.github/workflows/datastructures-algorithms-ci-cd.yaml b/.github/workflows/datastructures-algorithms-ci-cd.yaml
@@ -24,7 +24,7 @@ jobs:
 
     - name: Run clang-tidy
       run: |
-        find Headers -name '*.h' -o -name '*.hpp' ; find SourceCodes -name '*.cpp' -o -name '*.cc' -o -name '*.cxx' | \
+        find include -name '*.h' -o -name '*.hpp' ; find source -name '*.cpp' -o -name '*.cc' -o -name '*.cxx' | \
         xargs clang-tidy -p build --warnings-as-errors=*
 
     - name: Build

diff --git a/.gitignore b/.gitignore
@@ -1,2 +1,3 @@
 .vs/
-Build/
+build/
+install/
diff --git a/CMakeLists.txt b/CMakeLists.txt
@@ -6,11 +6,11 @@ set(CMAKE_CXX_STANDARD_REQUIRED ON)
 set(CMAKE_EXPORT_COMPILE_COMMANDS ON)
 
 
-# .clang-tidy settp
+# .clang-tidy setup
 find_program(CLANG_TIDY_EXE NAMES "clang-tidy")
 if(CLANG_TIDY_EXE)
     message(STATUS "clang-tidy found: ${CLANG_TIDY_EXE}")
-    set(CMAKE_CXX_CLANG_TIDY
+    set(CLANG_TIDY_COMMAND
         "${CLANG_TIDY_EXE}"
         "--config-file=${CMAKE_SOURCE_DIR}/.clang-tidy"
         "--extra-arg-before=-Wno-unknown-warning-option"
@@ -19,10 +19,10 @@ if(CLANG_TIDY_EXE)
     )
 endif()
 
-include_directories(${CMAKE_SOURCE_DIR}/Headers)
+include_directories(${CMAKE_SOURCE_DIR}/include)
 
-add_subdirectory(Headers)
-add_subdirectory(SourceCodes)
+add_subdirectory(include)
+add_subdirectory(source)
 
 cmake_policy(SET CMP0135 NEW)
 include(FetchContent)
@@ -36,4 +36,4 @@ set(gtest_force_shared_crt ON CACHE BOOL "" FORCE)
 
 enable_testing()
 
-add_subdirectory(Tests)
+add_subdirectory(test)
diff --git a/CMakePresets.json b/CMakePresets.json
@@ -5,8 +5,8 @@
             "name": "windows-base",
             "hidden": true,
             "generator": "Ninja",
-            "binaryDir": "${sourceDir}/Build/build/${presetName}",
-            "installDir": "${sourceDir}/Build/install/${presetName}",
+            "binaryDir": "${sourceDir}/build/${presetName}",
+            "installDir": "${sourceDir}/install/${presetName}",
             "cacheVariables": {
                 "CMAKE_C_COMPILER": "gcc",
                 "CMAKE_CXX_COMPILER": "g++"

diff --git a/README.md b/README.md
@@ -14,8 +14,8 @@ This repository contains a collection of **data structures and algorithms** impl
 
 ```plain text
 datastructures-algorithms  
-├── Headers            # Header Files
-├── SourceCodes        # Implementation of the solutions
-├── Tests              # Unit tests for implemented solutions
+├── include            # Header Files
+├── source             # Implementation of the solutions
+├── test               # Unit tests for implemented solutions
 └── CMakeLists.txt     # CMake configuration file
 ```
diff --git a/SourceCodes/0001_Basics/Node.cc b/SourceCodes/0001_Basics/Node.cc
diff --git a/Headers/0001_Basics/CMakeLists.txt → include/0001_Basics/CMakeLists.txt b/Headers/0001_Basics/CMakeLists.txt → include/0001_Basics/CMakeLists.txt
diff --git a/Headers/0001_Basics/Node.h → include/0001_Basics/Node.h b/Headers/0001_Basics/Node.h → include/0001_Basics/Node.h
diff --git a/Headers/0002_Tree/0001_BinarySearchTree.h → include/0002_Tree/0001_BinarySearchTree.h b/Headers/0002_Tree/0001_BinarySearchTree.h → include/0002_Tree/0001_BinarySearchTree.h
diff --git a/Headers/0002_Tree/CMakeLists.txt → include/0002_Tree/CMakeLists.txt b/Headers/0002_Tree/CMakeLists.txt → include/0002_Tree/CMakeLists.txt
diff --git a/Headers/0003_Graph/0001_BreadthFirstSearch.h → include/0003_Graph/0001_BreadthFirstSearch.h b/Headers/0003_Graph/0001_BreadthFirstSearch.h → include/0003_Graph/0001_BreadthFirstSearch.h
diff --git a/Headers/0003_Graph/0002_DepthFirstSearch.h → include/0003_Graph/0002_DepthFirstSearch.h b/Headers/0003_Graph/0002_DepthFirstSearch.h → include/0003_Graph/0002_DepthFirstSearch.h
diff --git a/Headers/0003_Graph/0003_TopologicalSort.h → include/0003_Graph/0003_TopologicalSort.h b/Headers/0003_Graph/0003_TopologicalSort.h → include/0003_Graph/0003_TopologicalSort.h
diff --git a/..._Graph/0004_StronglyConnectedComponents.h → ..._Graph/0004_StronglyConnectedComponents.h b/..._Graph/0004_StronglyConnectedComponents.h → ..._Graph/0004_StronglyConnectedComponents.h
diff --git a/...0003_Graph/0005_HamiltonianPathAndCycle.h → ...0003_Graph/0005_HamiltonianPathAndCycle.h b/...0003_Graph/0005_HamiltonianPathAndCycle.h → ...0003_Graph/0005_HamiltonianPathAndCycle.h
diff --git a/.../0003_Graph/0006_EulerianPathAndCircuit.h → .../0003_Graph/0006_EulerianPathAndCircuit.h b/.../0003_Graph/0006_EulerianPathAndCircuit.h → .../0003_Graph/0006_EulerianPathAndCircuit.h
diff --git a/...007_MinimumSpanningTreeKruskalAlgorithm.h → ...007_MinimumSpanningTreeKruskalAlgorithm.h b/...007_MinimumSpanningTreeKruskalAlgorithm.h → ...007_MinimumSpanningTreeKruskalAlgorithm.h
diff --git a/...h/0008_MinimumSpanningTreePrimAlgorithm.h → ...h/0008_MinimumSpanningTreePrimAlgorithm.h b/...h/0008_MinimumSpanningTreePrimAlgorithm.h → ...h/0008_MinimumSpanningTreePrimAlgorithm.h
diff --git a/...009_SingleSourceShortestPathBellmanFord.h → ...009_SingleSourceShortestPathBellmanFord.h b/...009_SingleSourceShortestPathBellmanFord.h → ...009_SingleSourceShortestPathBellmanFord.h
diff --git a/...h/0010_DirectedAcyclicGraphShortestPath.h → ...h/0010_DirectedAcyclicGraphShortestPath.h b/...h/0010_DirectedAcyclicGraphShortestPath.h → ...h/0010_DirectedAcyclicGraphShortestPath.h
diff --git a/...h/0011_SingleSourceShortestPathDijkstra.h → ...h/0011_SingleSourceShortestPathDijkstra.h b/...h/0011_SingleSourceShortestPathDijkstra.h → ...h/0011_SingleSourceShortestPathDijkstra.h
diff --git a/...0012_DifferenceConstraintsShortestPaths.h → ...0012_DifferenceConstraintsShortestPaths.h b/...0012_DifferenceConstraintsShortestPaths.h → ...0012_DifferenceConstraintsShortestPaths.h
diff --git a/...0013_AllPairsShortestPathsFloydWarshall.h → ...0013_AllPairsShortestPathsFloydWarshall.h b/...0013_AllPairsShortestPathsFloydWarshall.h → ...0013_AllPairsShortestPathsFloydWarshall.h
diff --git a/...Graph/0014_AllPairsShortestPathsJohnson.h → ...Graph/0014_AllPairsShortestPathsJohnson.h b/...Graph/0014_AllPairsShortestPathsJohnson.h → ...Graph/0014_AllPairsShortestPathsJohnson.h
diff --git a/...003_Graph/0015_MaximumFlowFordFulkerson.h → ...003_Graph/0015_MaximumFlowFordFulkerson.h b/...003_Graph/0015_MaximumFlowFordFulkerson.h → ...003_Graph/0015_MaximumFlowFordFulkerson.h
diff --git a/.../0003_Graph/0016_MaximumFlowEdmondsKarp.h → .../0003_Graph/0016_MaximumFlowEdmondsKarp.h b/.../0003_Graph/0016_MaximumFlowEdmondsKarp.h → .../0003_Graph/0016_MaximumFlowEdmondsKarp.h
diff --git a/...003_Graph/0017_MaximumBipartiteMatching.h → ...003_Graph/0017_MaximumBipartiteMatching.h b/...003_Graph/0017_MaximumBipartiteMatching.h → ...003_Graph/0017_MaximumBipartiteMatching.h
diff --git a/...8_MaximumFlowGoldbergGenericPushRelabel.h → ...8_MaximumFlowGoldbergGenericPushRelabel.h b/...8_MaximumFlowGoldbergGenericPushRelabel.h → ...8_MaximumFlowGoldbergGenericPushRelabel.h
diff --git a/...03_Graph/0019_MaximumFlowRelabelToFront.h → ...03_Graph/0019_MaximumFlowRelabelToFront.h b/...03_Graph/0019_MaximumFlowRelabelToFront.h → ...03_Graph/0019_MaximumFlowRelabelToFront.h
diff --git a/Headers/0003_Graph/CMakeLists.txt → include/0003_Graph/CMakeLists.txt b/Headers/0003_Graph/CMakeLists.txt → include/0003_Graph/CMakeLists.txt
diff --git a/Headers/0004_GreedyAlgorithms/CMakeLists.txt → include/0004_GreedyAlgorithms/CMakeLists.txt b/Headers/0004_GreedyAlgorithms/CMakeLists.txt → include/0004_GreedyAlgorithms/CMakeLists.txt
diff --git a/...rs/0005_DynamicProgramming/CMakeLists.txt → ...de/0005_DynamicProgramming/CMakeLists.txt b/...rs/0005_DynamicProgramming/CMakeLists.txt → ...de/0005_DynamicProgramming/CMakeLists.txt
diff --git a/...ers/0006_BitwiseAlgorithms/CMakeLists.txt → ...ude/0006_BitwiseAlgorithms/CMakeLists.txt b/...ers/0006_BitwiseAlgorithms/CMakeLists.txt → ...ude/0006_BitwiseAlgorithms/CMakeLists.txt
diff --git a/Headers/CMakeLists.txt → include/CMakeLists.txt b/Headers/CMakeLists.txt → include/CMakeLists.txt
diff --git a/SourceCodes/0001_Basics/CMakeLists.txt → source/0001_Basics/CMakeLists.txt b/SourceCodes/0001_Basics/CMakeLists.txt → source/0001_Basics/CMakeLists.txt
@@ -4,4 +4,4 @@ set(0001BASICS_SOURCES
 )
 
 # Create a library target
-add_library(0001Basics ${0001BASICS_SOURCES})
+add_library(0001BASICS ${0001BASICS_SOURCES})
diff --git a/source/0001_Basics/Node.cc b/source/0001_Basics/Node.cc
@@ -0,0 +1,6 @@
+#include "../include/0001_Basics/Node.h"
+
+Node::Node()
+{
+	value = 8;
+}
diff --git a/...eCodes/0002_Tree/0001_BinarySearchTree.cc → source/0002_Tree/0001_BinarySearchTree.cc b/...eCodes/0002_Tree/0001_BinarySearchTree.cc → source/0002_Tree/0001_BinarySearchTree.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0002_Tree/0001_BinarySearchTree.h"
+#include "../include/0002_Tree/0001_BinarySearchTree.h"
 #include<iostream>
 #include<algorithm>
 using namespace std;

diff --git a/SourceCodes/0002_Tree/CMakeLists.txt → source/0002_Tree/CMakeLists.txt b/SourceCodes/0002_Tree/CMakeLists.txt → source/0002_Tree/CMakeLists.txt
diff --git a/...des/0003_Graph/0001_BreadthFirstSearch.cc → source/0003_Graph/0001_BreadthFirstSearch.cc b/...des/0003_Graph/0001_BreadthFirstSearch.cc → source/0003_Graph/0001_BreadthFirstSearch.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0001_BreadthFirstSearch.h"
+#include "../include/0003_Graph/0001_BreadthFirstSearch.h"
 #include<iostream>
 #include<queue>
 #include<vector>

diff --git a/...Codes/0003_Graph/0002_DepthFirstSearch.cc → source/0003_Graph/0002_DepthFirstSearch.cc b/...Codes/0003_Graph/0002_DepthFirstSearch.cc → source/0003_Graph/0002_DepthFirstSearch.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0002_DepthFirstSearch.h"
+#include "../include/0003_Graph/0002_DepthFirstSearch.h"
 #include<vector>
 #include<utility>
 #include<climits>

diff --git a/...eCodes/0003_Graph/0003_TopologicalSort.cc → source/0003_Graph/0003_TopologicalSort.cc b/...eCodes/0003_Graph/0003_TopologicalSort.cc → source/0003_Graph/0003_TopologicalSort.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0003_TopologicalSort.h"
+#include "../include/0003_Graph/0003_TopologicalSort.h"
 #include<vector>
 #include<queue>
 #include<utility>

diff --git a/...Graph/0004_StronglyConnectedComponents.cc → ...Graph/0004_StronglyConnectedComponents.cc b/...Graph/0004_StronglyConnectedComponents.cc → ...Graph/0004_StronglyConnectedComponents.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0004_StronglyConnectedComponents.h"
+#include "../include/0003_Graph/0004_StronglyConnectedComponents.h"
 #include<vector>
 #include<utility>
 #include<climits>

diff --git a/...003_Graph/0005_HamiltonianPathAndCycle.cc → ...003_Graph/0005_HamiltonianPathAndCycle.cc b/...003_Graph/0005_HamiltonianPathAndCycle.cc → ...003_Graph/0005_HamiltonianPathAndCycle.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0005_HamiltonianPathAndCycle.h"
+#include "../include/0003_Graph/0005_HamiltonianPathAndCycle.h"
 
 using namespace std;
 namespace HamiltonianPathAndCycle

diff --git a/...0003_Graph/0006_EulerianPathAndCircuit.cc → ...0003_Graph/0006_EulerianPathAndCircuit.cc b/...0003_Graph/0006_EulerianPathAndCircuit.cc → ...0003_Graph/0006_EulerianPathAndCircuit.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0006_EulerianPathAndCircuit.h"
+#include "../include/0003_Graph/0006_EulerianPathAndCircuit.h"
 #include<stack>
 #include<algorithm>
 using namespace std;

diff --git a/...07_MinimumSpanningTreeKruskalAlgorithm.cc → ...07_MinimumSpanningTreeKruskalAlgorithm.cc b/...07_MinimumSpanningTreeKruskalAlgorithm.cc → ...07_MinimumSpanningTreeKruskalAlgorithm.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h"
+#include "../include/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h"
 #include<climits>
 #include<algorithm>
 using namespace std;

diff --git a/.../0008_MinimumSpanningTreePrimAlgorithm.cc → .../0008_MinimumSpanningTreePrimAlgorithm.cc b/.../0008_MinimumSpanningTreePrimAlgorithm.cc → .../0008_MinimumSpanningTreePrimAlgorithm.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0008_MinimumSpanningTreePrimAlgorithm.h"
+#include "../include/0003_Graph/0008_MinimumSpanningTreePrimAlgorithm.h"
 #include<climits>
 using namespace std;
 

diff --git a/...09_SingleSourceShortestPathBellmanFord.cc → ...09_SingleSourceShortestPathBellmanFord.cc b/...09_SingleSourceShortestPathBellmanFord.cc → ...09_SingleSourceShortestPathBellmanFord.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h"
+#include "../include/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h"
 #include<climits>
 #include<algorithm>
 using namespace std;

diff --git a/.../0010_DirectedAcyclicGraphShortestPath.cc → .../0010_DirectedAcyclicGraphShortestPath.cc b/.../0010_DirectedAcyclicGraphShortestPath.cc → .../0010_DirectedAcyclicGraphShortestPath.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h"
+#include "../include/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h"
 #include<climits>
 #include<algorithm>
 using namespace std;

diff --git a/.../0011_SingleSourceShortestPathDijkstra.cc → .../0011_SingleSourceShortestPathDijkstra.cc b/.../0011_SingleSourceShortestPathDijkstra.cc → .../0011_SingleSourceShortestPathDijkstra.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0011_SingleSourceShortestPathDijkstra.h"
+#include "../include/0003_Graph/0011_SingleSourceShortestPathDijkstra.h"
 #include<climits>
 #include<algorithm>
 using namespace std;

diff --git a/...012_DifferenceConstraintsShortestPaths.cc → ...012_DifferenceConstraintsShortestPaths.cc b/...012_DifferenceConstraintsShortestPaths.cc → ...012_DifferenceConstraintsShortestPaths.cc
@@ -1,4 +1,4 @@
-#include"../Headers/0003_Graph/0012_DifferenceConstraintsShortestPaths.h"
+#include"../include/0003_Graph/0012_DifferenceConstraintsShortestPaths.h"
 #include<climits>
 using namespace std;
 

diff --git a/...013_AllPairsShortestPathsFloydWarshall.cc → ...013_AllPairsShortestPathsFloydWarshall.cc b/...013_AllPairsShortestPathsFloydWarshall.cc → ...013_AllPairsShortestPathsFloydWarshall.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0013_AllPairsShortestPathsFloydWarshall.h"
+#include "../include/0003_Graph/0013_AllPairsShortestPathsFloydWarshall.h"
 #include<climits>
 using namespace std;
 

diff --git a/...raph/0014_AllPairsShortestPathsJohnson.cc → ...raph/0014_AllPairsShortestPathsJohnson.cc b/...raph/0014_AllPairsShortestPathsJohnson.cc → ...raph/0014_AllPairsShortestPathsJohnson.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0014_AllPairsShortestPathsJohnson.h"
+#include "../include/0003_Graph/0014_AllPairsShortestPathsJohnson.h"
 #include<climits>
 using namespace std;
 

diff --git a/...03_Graph/0015_MaximumFlowFordFulkerson.cc → ...03_Graph/0015_MaximumFlowFordFulkerson.cc b/...03_Graph/0015_MaximumFlowFordFulkerson.cc → ...03_Graph/0015_MaximumFlowFordFulkerson.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0015_MaximumFlowFordFulkerson.h"
+#include "../include/0003_Graph/0015_MaximumFlowFordFulkerson.h"
 #include<climits>
 using namespace std;
 

diff --git a/...0003_Graph/0016_MaximumFlowEdmondsKarp.cc → ...0003_Graph/0016_MaximumFlowEdmondsKarp.cc b/...0003_Graph/0016_MaximumFlowEdmondsKarp.cc → ...0003_Graph/0016_MaximumFlowEdmondsKarp.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0016_MaximumFlowEdmondsKarp.h"
+#include "../include/0003_Graph/0016_MaximumFlowEdmondsKarp.h"
 #include<climits>
 #include<queue>
 using namespace std;

diff --git a/...03_Graph/0017_MaximumBipartiteMatching.cc → ...03_Graph/0017_MaximumBipartiteMatching.cc b/...03_Graph/0017_MaximumBipartiteMatching.cc → ...03_Graph/0017_MaximumBipartiteMatching.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0017_MaximumBipartiteMatching.h"
+#include "../include/0003_Graph/0017_MaximumBipartiteMatching.h"
 #include<climits>
 #include<queue>
 using namespace std;

diff --git a/..._MaximumFlowGoldbergGenericPushRelabel.cc → ..._MaximumFlowGoldbergGenericPushRelabel.cc b/..._MaximumFlowGoldbergGenericPushRelabel.cc → ..._MaximumFlowGoldbergGenericPushRelabel.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0018_MaximumFlowGoldbergGenericPushRelabel.h"
+#include "../include/0003_Graph/0018_MaximumFlowGoldbergGenericPushRelabel.h"
 #include<climits>
 using namespace std;
 

diff --git a/...3_Graph/0019_MaximumFlowRelabelToFront.cc → ...3_Graph/0019_MaximumFlowRelabelToFront.cc b/...3_Graph/0019_MaximumFlowRelabelToFront.cc → ...3_Graph/0019_MaximumFlowRelabelToFront.cc
@@ -1,4 +1,4 @@
-#include "../Headers/0003_Graph/0019_MaximumFlowRelabelToFront.h"
+#include "../include/0003_Graph/0019_MaximumFlowRelabelToFront.h"
 #include<climits>
 #include<iterator>
 using namespace std;

diff --git a/SourceCodes/0003_Graph/CMakeLists.txt → source/0003_Graph/CMakeLists.txt b/SourceCodes/0003_Graph/CMakeLists.txt → source/0003_Graph/CMakeLists.txt
diff --git a/...odes/0004_GreedyAlgorithms/CMakeLists.txt → source/0004_GreedyAlgorithms/CMakeLists.txt b/...odes/0004_GreedyAlgorithms/CMakeLists.txt → source/0004_GreedyAlgorithms/CMakeLists.txt
diff --git a/...es/0005_DynamicProgramming/CMakeLists.txt → ...ce/0005_DynamicProgramming/CMakeLists.txt b/...es/0005_DynamicProgramming/CMakeLists.txt → ...ce/0005_DynamicProgramming/CMakeLists.txt
diff --git a/...des/0006_BitwiseAlgorithms/CMakeLists.txt → source/0006_BitwiseAlgorithms/CMakeLists.txt b/...des/0006_BitwiseAlgorithms/CMakeLists.txt → source/0006_BitwiseAlgorithms/CMakeLists.txt
diff --git a/SourceCodes/CMakeLists.txt → source/CMakeLists.txt b/SourceCodes/CMakeLists.txt → source/CMakeLists.txt
diff --git a/Tests/0000_CommonUtilities/CMakeLists.txt → test/0000_CommonUtilities/CMakeLists.txt b/Tests/0000_CommonUtilities/CMakeLists.txt → test/0000_CommonUtilities/CMakeLists.txt
diff --git a/Tests/0000_CommonUtilities/UnitTestHelper.h → test/0000_CommonUtilities/UnitTestHelper.h b/Tests/0000_CommonUtilities/UnitTestHelper.h → test/0000_CommonUtilities/UnitTestHelper.h
diff --git a/Tests/0001_Basics/CMakeLists.txt → test/0001_Basics/CMakeLists.txt b/Tests/0001_Basics/CMakeLists.txt → test/0001_Basics/CMakeLists.txt
@@ -13,19 +13,19 @@ FetchContent_MakeAvailable(googletest)
 enable_testing()
 
 add_executable(
-  0001-Basics-Tests
+  0001BasicsTests
   NodeTest.cc)
 
 target_link_libraries(
-  0001-Basics-Tests
+  0001BasicsTests
   GTest::gtest_main
+  0001BASICS
 )
 
-target_link_libraries(
-  0001-Basics-Tests
-  0001Basics
-)
-
+# Add .clang-tidy configuration to this library.
+if(CLANG_TIDY_EXE)
+  set_target_properties(0001BASICS PROPERTIES CXX_CLANG_TIDY "${CLANG_TIDY_COMMAND}")
+endif()
 
 include(GoogleTest)
-gtest_discover_tests(0001-Basics-Tests DISCOVERY_TIMEOUT 30)
+gtest_discover_tests(0001BasicsTests DISCOVERY_TIMEOUT 30)
diff --git a/Tests/0001_Basics/NodeTest.cc → test/0001_Basics/NodeTest.cc b/Tests/0001_Basics/NodeTest.cc → test/0001_Basics/NodeTest.cc
@@ -1,5 +1,5 @@
 #include <gtest/gtest.h>
-#include "../Headers/0001_Basics/Node.h"
+#include "../include/0001_Basics/Node.h"
 
 // Demonstrate some basic assertions.
 namespace NodeTesting

diff --git a/Tests/0002_Tree/0001_BinarySearchTreeTest.cc → test/0002_Tree/0001_BinarySearchTreeTest.cc b/Tests/0002_Tree/0001_BinarySearchTreeTest.cc → test/0002_Tree/0001_BinarySearchTreeTest.cc
@@ -1,6 +1,6 @@
 #include <gtest/gtest.h>
 #include<string>
-#include "../Headers/0002_Tree/0001_BinarySearchTree.h"
+#include "../include/0002_Tree/0001_BinarySearchTree.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace BinarySearchTree

diff --git a/Tests/0002_Tree/CMakeLists.txt → test/0002_Tree/CMakeLists.txt b/Tests/0002_Tree/CMakeLists.txt → test/0002_Tree/CMakeLists.txt
@@ -5,22 +5,28 @@ FetchContent_Declare(
   googletest
   URL https://github.com/google/googletest/archive/03597a01ee50ed33e9dfd640b249b4be3799d395.zip
 )
+
 # For Windows: Prevent overriding the parent project's compiler/linker settings
 set(gtest_force_shared_crt ON CACHE BOOL "" FORCE)
 FetchContent_MakeAvailable(googletest)
 
-
 enable_testing()
 
 add_executable(
   0002TreeTests
-  0001_BinarySearchTreeTest.cc)
+  0001_BinarySearchTreeTest.cc
+)
 
 target_link_libraries(
   0002TreeTests
   GTest::gtest_main
   0002TREE
 )
 
+# Add .clang-tidy configuration to this library.
+if(CLANG_TIDY_EXE)
+  set_target_properties(0002TREE PROPERTIES CXX_CLANG_TIDY "${CLANG_TIDY_COMMAND}")
+endif()
+
 include(GoogleTest)
 gtest_discover_tests(0002TreeTests DISCOVERY_TIMEOUT 30)
diff --git a/...0003_Graph/0001_BreadthFirstSearchTest.cc → ...0003_Graph/0001_BreadthFirstSearchTest.cc b/...0003_Graph/0001_BreadthFirstSearchTest.cc → ...0003_Graph/0001_BreadthFirstSearchTest.cc
@@ -1,6 +1,6 @@
 #include <gtest/gtest.h>
 #include<string>
-#include "../Headers/0003_Graph/0001_BreadthFirstSearch.h"
+#include "../include/0003_Graph/0001_BreadthFirstSearch.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace BreadthFirstSearch

diff --git a/...s/0003_Graph/0002_DepthFirstSearchTest.cc → test/0003_Graph/0002_DepthFirstSearchTest.cc b/...s/0003_Graph/0002_DepthFirstSearchTest.cc → test/0003_Graph/0002_DepthFirstSearchTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0002_DepthFirstSearch.h"
+#include "../include/0003_Graph/0002_DepthFirstSearch.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace DepthFirstSearch

diff --git a/Tests/0003_Graph/0003_TopologicalSortTest.cc → test/0003_Graph/0003_TopologicalSortTest.cc b/Tests/0003_Graph/0003_TopologicalSortTest.cc → test/0003_Graph/0003_TopologicalSortTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0003_TopologicalSort.h"
+#include "../include/0003_Graph/0003_TopologicalSort.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace TopologicalSort

diff --git a/...h/0004_StronglyConnectedComponentsTest.cc → ...h/0004_StronglyConnectedComponentsTest.cc b/...h/0004_StronglyConnectedComponentsTest.cc → ...h/0004_StronglyConnectedComponentsTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0004_StronglyConnectedComponents.h"
+#include "../include/0003_Graph/0004_StronglyConnectedComponents.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace StronglyConnectedComponents

diff --git a/...Graph/0005_HamiltonianPathAndCycleTest.cc → ...Graph/0005_HamiltonianPathAndCycleTest.cc b/...Graph/0005_HamiltonianPathAndCycleTest.cc → ...Graph/0005_HamiltonianPathAndCycleTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0005_HamiltonianPathAndCycle.h"
+#include "../include/0003_Graph/0005_HamiltonianPathAndCycle.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace HamiltonianPathAndCycle

diff --git a/..._Graph/0006_EulerianPathAndCircuitTest.cc → ..._Graph/0006_EulerianPathAndCircuitTest.cc b/..._Graph/0006_EulerianPathAndCircuitTest.cc → ..._Graph/0006_EulerianPathAndCircuitTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0006_EulerianPathAndCircuit.h"
+#include "../include/0003_Graph/0006_EulerianPathAndCircuit.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace EulerianPathAndCircuit

diff --git a/...inimumSpanningTreeKruskalAlgorithmTest.cc → ...inimumSpanningTreeKruskalAlgorithmTest.cc b/...inimumSpanningTreeKruskalAlgorithmTest.cc → ...inimumSpanningTreeKruskalAlgorithmTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h"
+#include "../include/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace MinimumSpanningTreeKruskalAlgorithm

diff --git a/...8_MinimumSpanningTreePrimAlgorithmTest.cc → ...8_MinimumSpanningTreePrimAlgorithmTest.cc b/...8_MinimumSpanningTreePrimAlgorithmTest.cc → ...8_MinimumSpanningTreePrimAlgorithmTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0008_MinimumSpanningTreePrimAlgorithm.h"
+#include "../include/0003_Graph/0008_MinimumSpanningTreePrimAlgorithm.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace MinimumSpanningTreePrimAlgorithm

diff --git a/...ingleSourceShortestPathBellmanFordTest.cc → ...ingleSourceShortestPathBellmanFordTest.cc b/...ingleSourceShortestPathBellmanFordTest.cc → ...ingleSourceShortestPathBellmanFordTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h"
+#include "../include/0003_Graph/0009_SingleSourceShortestPathBellmanFord.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace SingleSourceShortestPathBellmanFord

diff --git a/...0_DirectedAcyclicGraphShortestPathTest.cc → ...0_DirectedAcyclicGraphShortestPathTest.cc b/...0_DirectedAcyclicGraphShortestPathTest.cc → ...0_DirectedAcyclicGraphShortestPathTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h"
+#include "../include/0003_Graph/0010_DirectedAcyclicGraphShortestPath.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace DirectedAcyclicGraphShortestPath

diff --git a/...1_SingleSourceShortestPathDijkstraTest.cc → ...1_SingleSourceShortestPathDijkstraTest.cc b/...1_SingleSourceShortestPathDijkstraTest.cc → ...1_SingleSourceShortestPathDijkstraTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include "../Headers/0003_Graph/0011_SingleSourceShortestPathDijkstra.h"
+#include "../include/0003_Graph/0011_SingleSourceShortestPathDijkstra.h"
 #include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace SingleSourceShortestPathDijkstra

diff --git a/...DifferenceConstraintsShortestPathsTest.cc → ...DifferenceConstraintsShortestPathsTest.cc b/...DifferenceConstraintsShortestPathsTest.cc → ...DifferenceConstraintsShortestPathsTest.cc
@@ -1,5 +1,5 @@
 #include<gtest/gtest.h>
-#include"../Headers/0003_Graph/0012_DifferenceConstraintsShortestPaths.h"
+#include"../include/0003_Graph/0012_DifferenceConstraintsShortestPaths.h"
 #include"../0000_CommonUtilities/UnitTestHelper.h"
 using namespace std;