Add: test case

yonghenghuanmie · Jul 19, 2022 · c9980b6 · c9980b6
1 parent 6657227
commit c9980b6
Show file tree

Hide file tree

Showing 4 changed files with 93 additions and 2 deletions.
diff --git a/Graph/CMakeLists.txt b/Graph/CMakeLists.txt
@@ -3,4 +3,11 @@ cmake_minimum_required(VERSION 3.15)
 project(Graph)
 add_library(${PROJECT_NAME} INTERFACE)
 target_include_directories(${PROJECT_NAME} INTERFACE $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}>)
-install(FILES Graph.h DESTINATION include)
+install(FILES Graph.h DESTINATION include)
+
+project(Example)
+set(CMAKE_CXX_STANDARD 20)
+set(CMAKE_CXX_STANDARD_REQUIRED ON)
+add_executable(${PROJECT_NAME} Example.cpp)
+target_include_directories(${PROJECT_NAME} PRIVATE $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}> $<INSTALL_INTERFACE:include>)
+target_link_libraries(${PROJECT_NAME} PRIVATE Graph)
diff --git a/Graph/CMakeSettings.json b/Graph/CMakeSettings.json
@@ -0,0 +1,55 @@
+{
+    "configurations": [
+        {
+            "name": "x64-Debug",
+            "generator": "Ninja",
+            "configurationType": "Debug",
+            "inheritEnvironments": [ "msvc_x64_x64" ],
+            "buildRoot": "${projectDir}\\out\\build\\${name}",
+            "installRoot": "${projectDir}\\out\\install\\${name}",
+            "cmakeCommandArgs": "",
+            "buildCommandArgs": "",
+            "ctestCommandArgs": ""
+        },
+        {
+            "name": "x64-Release",
+            "generator": "Ninja",
+            "configurationType": "RelWithDebInfo",
+            "buildRoot": "${projectDir}\\out\\build\\${name}",
+            "installRoot": "${projectDir}\\out\\install\\${name}",
+            "cmakeCommandArgs": "",
+            "buildCommandArgs": "",
+            "ctestCommandArgs": "",
+            "inheritEnvironments": [ "msvc_x64_x64" ],
+            "variables": []
+        },
+        {
+            "name": "WSL-GCC-Debug",
+            "generator": "Ninja",
+            "configurationType": "Debug",
+            "buildRoot": "${projectDir}\\out\\build\\${name}",
+            "installRoot": "${projectDir}\\out\\install\\${name}",
+            "cmakeExecutable": "cmake",
+            "cmakeCommandArgs": "",
+            "buildCommandArgs": "",
+            "ctestCommandArgs": "",
+            "inheritEnvironments": [ "linux_x64" ],
+            "wslPath": "${defaultWSLPath}",
+            "variables": []
+        },
+        {
+            "name": "WSL-GCC-Release",
+            "generator": "Ninja",
+            "configurationType": "RelWithDebInfo",
+            "buildRoot": "${projectDir}\\out\\build\\${name}",
+            "installRoot": "${projectDir}\\out\\install\\${name}",
+            "cmakeExecutable": "cmake",
+            "cmakeCommandArgs": "",
+            "buildCommandArgs": "",
+            "ctestCommandArgs": "",
+            "inheritEnvironments": [ "linux_x64" ],
+            "wslPath": "${defaultWSLPath}",
+            "variables": []
+        }
+    ]
+}
diff --git a/Graph/Example.cpp b/Graph/Example.cpp
@@ -0,0 +1,29 @@
+#include <limits>
+#include <numeric>
+#include <algorithm>
+#include <execution>
+#include <functional>
+#include <unordered_set>
+#include <unordered_map>
+#include "Graph.h"
+
+int main()
+{
+	Graph<std::string> graph{
+		{ "A", 9, "B" }, { "A", 5, "C" }, { "C", 2, "B" },
+		{ "A", 3, "D" }, { "B", 5, "D" }, { "D", 2, "C" },
+		{ "D", 2, "E" }, { "D", 5, "B" }, { "C", 4, "E" },
+		{ "B", 2, "F" }, { "F", 1, "E" }, { "C", 5, "F" },
+	};
+	graph.AddEdge("C", 3, "D");
+	auto out_path = graph.GetOutPath("C");
+	out_path.clear();
+	graph.RemoveEdge("C", "D");
+	graph.GetOutPath("C", [&out_path](auto&& new_path) {out_path.push_back(new_path); });
+	auto in_path = graph.GetInPath("B");
+	in_path.clear();
+	graph.GetInPath("B", [&in_path](auto&& new_path) {in_path.push_back(new_path); });
+	auto weight = graph.GetWeight("C", "D");
+	auto result = graph.GetBestPath("A", "E");
+	return 0;
+}
diff --git a/Graph/Graph.h b/Graph/Graph.h
@@ -72,7 +72,7 @@ class Graph
 	{
 		for (auto iterator = matrix.begin(); iterator != matrix.end(); ++iterator)
 			if (iterator->second.contains(vertex) && iterator->second[vertex] != INFINITE)
-				callback({ iterator->first, iterator->second[vertex] });
+				callback(PathType{ iterator->first, iterator->second[vertex] });
 	}
 
 	void SetBestPathAlgorithm(std::invocable<const Vertex&, const Vertex&, Compare> auto&& function)