From 89caa89ee21df57aa6573472a2b6c64ac202ff16 Mon Sep 17 00:00:00 2001
From: David Rosca <roscadav@fit.cvut.cz>
Date: Sat, 21 Mar 2015 21:33:19 +0100
Subject: [PATCH] Topological sort: Remove function for Undirected Graph
+ fix unused variables warning
---
alib2algo/src/graph/sort/TopologicalSort.cpp | 10 +++-------
alib2algo/src/graph/sort/TopologicalSort.h | 7 +++----
2 files changed, 6 insertions(+), 11 deletions(-)
diff --git a/alib2algo/src/graph/sort/TopologicalSort.cpp b/alib2algo/src/graph/sort/TopologicalSort.cpp
index c195309d74..6556074b1c 100644
--- a/alib2algo/src/graph/sort/TopologicalSort.cpp
+++ b/alib2algo/src/graph/sort/TopologicalSort.cpp
@@ -9,8 +9,7 @@ namespace graph
namespace sort
{
-template <typename T>
-static TopologicalSort::Result topsort_impl(const T &graph)
+static TopologicalSort::Result topsort_impl(const DirectedGraph &graph)
{
TopologicalSort::Result s;
std::unordered_map<Node, bool> visited;
@@ -41,11 +40,6 @@ TopologicalSort::Result TopologicalSort::topologicalsort(const DirectedGraph &gr
return topsort_impl(graph);
}
-TopologicalSort::Result TopologicalSort::topologicalsort(const UndirectedGraph &graph)
-{
- return topsort_impl(graph);
-}
-
void TopologicalSort::Visit(void *data, const DirectedGraph &graph) const
{
Result *r = static_cast<Result*>(data);
@@ -54,6 +48,8 @@ void TopologicalSort::Visit(void *data, const DirectedGraph &graph) const
void TopologicalSort::Visit(void *data, const UndirectedGraph &graph) const
{
+ (void) data;
+ (void) graph;
throw exception::AlibException("Unsupported graph type UndirectedGraph");
}
diff --git a/alib2algo/src/graph/sort/TopologicalSort.h b/alib2algo/src/graph/sort/TopologicalSort.h
index 5dd16cfca6..ec30472bc7 100644
--- a/alib2algo/src/graph/sort/TopologicalSort.h
+++ b/alib2algo/src/graph/sort/TopologicalSort.h
@@ -1,5 +1,5 @@
-#ifndef GRAPH_TOPOLOGICAL_SORT_FORD_H_
-#define GRAPH_TOPOLOGICAL_SORT_FORD_H_
+#ifndef GRAPH_TOPOLOGICAL_SORT_H_
+#define GRAPH_TOPOLOGICAL_SORT_H_
#include <list>
@@ -21,7 +21,6 @@ public:
static Result topologicalsort(const Graph &graph);
static Result topologicalsort(const DirectedGraph &graph);
- static Result topologicalsort(const UndirectedGraph &graph);
private:
void Visit(void *data, const DirectedGraph &graph) const;
@@ -34,4 +33,4 @@ private:
} // namespace graph
-#endif // GRAPH_TOPOLOGICAL_SORT_FORD_H_
+#endif // GRAPH_TOPOLOGICAL_SORT_H_
--
GitLab