Modified: change 'Infinite' from template parameter to constructor pa…

…rameter

Graph/Example.cpp

@@ -9,12 +9,12 @@
 
 int main()
 {
-	Graph<std::string> graph{
+	Graph<std::string> graph(std::numeric_limits<int>::max(), {
 		{ "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", "D") = 3;
 	auto out_path = graph.GetOutPath("C");
 	out_path.clear();

Graph/Graph.h

@@ -1,6 +1,6 @@
 #pragma once
 
-template<typename Vertex, typename Weight = int, Weight Infinite = std::numeric_limits<Weight>::max()>
+template<typename Vertex, typename Weight = int>
 class Graph
 {
 	using AdjacencyMatrix = std::unordered_map<Vertex, std::unordered_map<Vertex, Weight>>;
@@ -11,13 +11,13 @@ class Graph
 	std::function<std::vector<PathType>(const Vertex&, const Vertex&, Compare)> best_path;
 
 public:
-	constexpr static Weight INFINITE = Infinite;
+	const Weight INFINITE;
 
-	Graph() = default;
+	Graph(const Weight& Infinite) :INFINITE(Infinite) {}
 
-	Graph(auto&&... rests) { Construct(std::forward<decltype(rests)>(rests)...); }
+	Graph(const Weight& Infinite, auto&&... rests) :INFINITE(Infinite) { Construct(std::forward<decltype(rests)>(rests)...); }
 
-	Graph(std::initializer_list<std::tuple<Vertex, Weight, Vertex>> list)
+	Graph(const Weight& Infinite, std::initializer_list<std::tuple<Vertex, Weight, Vertex>> list) :INFINITE(Infinite)
 	{
 		for (auto&& element : list)
 			AddEdge(std::get<0>(element), std::get<2>(element)) = std::get<1>(element);