From 3a63af2aaa8f9e4b84d0996dedbf7dce866ac81f Mon Sep 17 00:00:00 2001
From: Dennis Luxen <info@project-osrm.org>
Date: Tue, 28 May 2024 20:27:18 +0200
Subject: [PATCH] Remove unused header file

---
 include/util/matrix_graph_wrapper.hpp | 49 ---------------------------
 1 file changed, 49 deletions(-)
 delete mode 100644 include/util/matrix_graph_wrapper.hpp

diff --git a/include/util/matrix_graph_wrapper.hpp b/include/util/matrix_graph_wrapper.hpp
deleted file mode 100644
index c40fd131a..000000000
--- a/include/util/matrix_graph_wrapper.hpp
+++ /dev/null
@@ -1,49 +0,0 @@
-#ifndef MATRIX_GRAPH_WRAPPER_H
-#define MATRIX_GRAPH_WRAPPER_H
-
-#include <cstddef>
-#include <iterator>
-#include <vector>
-
-#include "util/typedefs.hpp"
-
-namespace osrm::util
-{
-
-// This Wrapper provides all methods that are needed for util::TarjanSCC, when the graph is
-// given in a matrix representation (e.g. as output from a distance table call)
-
-template <typename T> class MatrixGraphWrapper
-{
-  public:
-    MatrixGraphWrapper(std::vector<T> table, const std::size_t number_of_nodes)
-        : table_(std::move(table)), number_of_nodes_(number_of_nodes)
-    {
-    }
-
-    std::size_t GetNumberOfNodes() const { return number_of_nodes_; }
-
-    std::vector<T> GetAdjacentEdgeRange(const NodeID node) const
-    {
-
-        std::vector<T> edges;
-        // find all valid adjacent edges and move to vector `edges`
-        for (std::size_t i = 0; i < number_of_nodes_; ++i)
-        {
-            if (*(std::begin(table_) + node * number_of_nodes_ + i) != INVALID_EDGE_WEIGHT)
-            {
-                edges.push_back(i);
-            }
-        }
-        return edges;
-    }
-
-    EdgeWeight GetTarget(const EdgeWeight edge) const { return edge; }
-
-  private:
-    const std::vector<T> table_;
-    const std::size_t number_of_nodes_;
-};
-} // namespace osrm::util
-
-#endif // MATRIX_GRAPH_WRAPPER_H