fix some remaining warnings

ad-freiburg · Oct 11, 2024 · df1e6a5 · df1e6a5
1 parent e3104a7
commit df1e6a5
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 3 deletions.
diff --git a/include/osm2rdf/util/DirectedGraph.h b/include/osm2rdf/util/DirectedGraph.h
@@ -36,10 +36,10 @@ class DirectedGraph {
   void addEdge(T src, T dst);
   // findSuccessors returns the ids of all successor vertices of the given
   // vertex.
-  [[nodiscard]] std::vector<T> findSuccessors(T src) const;
+  std::vector<T> findSuccessors(T src) const;
   // findSuccessorsFast returns the same result as findSuccessors but faster,
   // after data is prepared for faster lookup.
-  [[nodiscard]] std::vector<T> findSuccessorsFast(T src) const;
+  std::vector<T> findSuccessorsFast(T src) const;
   // dump stores the complete graph in DOT-Format in a file at the given path.
   void dump(const std::filesystem::path& filename) const;
   // dumpOsm stores the complete graph in DOT-Format in a file at the given

diff --git a/src/util/DirectedGraph.cpp b/src/util/DirectedGraph.cpp
@@ -136,7 +136,6 @@ void osm2rdf::util::DirectedGraph<T>::dumpOsm(
 // ____________________________________________________________________________
 template <typename T>
 void osm2rdf::util::DirectedGraph<T>::prepareFindSuccessorsFast() {
-  const auto& vertices = getVertices();
   for (const auto& [key, _] : _adjacency) {
     _successors[key] = findSuccessors(key);
   }