FM / partitioner

/srv/osrm/osrm-backend/src/partitioner

Name	Size	Mode	Actions
bisection_graph_view.cpp	1700	0644	edit dl rm
bisection_to_partition.cpp	5497	0644	edit dl rm
dinic_max_flow.cpp	12138	0644	edit dl rm
inertial_flow.cpp	5054	0644	edit dl rm
partitioner.cpp	9053	0644	edit dl rm
recursive_bisection.cpp	3998	0644	edit dl rm
recursive_bisection_state.cpp	7165	0644	edit dl rm
renumber.cpp	2594	0644	edit dl rm
tarjan_graph_wrapper.cpp	639	0644	edit dl rm

Edit: /srv/osrm/osrm-backend/src/partitioner/bisection_graph_view.cpp (1700B)

#include "partitioner/bisection_graph_view.hpp"

#include <iostream>
#include <iterator>

#include <boost/assert.hpp>

namespace osrm::partitioner
{

BisectionGraphView::BisectionGraphView(const BisectionGraph &bisection_graph_)
    : BisectionGraphView(bisection_graph_, bisection_graph_.CBegin(), bisection_graph_.CEnd())
{
}

BisectionGraphView::BisectionGraphView(const BisectionGraph &bisection_graph_,
                                       const BisectionGraph::ConstNodeIterator begin_,
                                       const BisectionGraph::ConstNodeIterator end_)
    : bisection_graph(bisection_graph_), begin(begin_), end(end_)
{
}

BisectionGraphView::BisectionGraphView(const BisectionGraphView &other_view,
                                       const BisectionGraph::ConstNodeIterator begin_,
                                       const BisectionGraph::ConstNodeIterator end_)
    : BisectionGraphView(other_view.bisection_graph, begin_, end_)
{
}

std::size_t BisectionGraphView::NumberOfNodes() const { return std::distance(begin, end); }

NodeID BisectionGraphView::GetID(const NodeT &node) const
{
    const auto node_id = static_cast<NodeID>(&node - &(*begin));
    BOOST_ASSERT(node_id < NumberOfNodes());
    return node_id;
}

BisectionGraph::ConstNodeIterator BisectionGraphView::Begin() const { return begin; }

BisectionGraph::ConstNodeIterator BisectionGraphView::End() const { return end; }

const BisectionGraphView::NodeT &BisectionGraphView::Node(const NodeID nid) const
{
    return *(begin + nid);
}

const BisectionGraphView::EdgeT &BisectionGraphView::Edge(const EdgeID eid) const
{
    return bisection_graph.Edge(eid);
}

} // namespace osrm::partitioner

#include "partitioner/bisection_graph_view.hpp" #include #include #include namespace osrm::partitioner { BisectionGraphView::BisectionGraphView(const BisectionGraph &bisection_graph_) : BisectionGraphView(bisection_graph_, bisection_graph_.CBegin(), bisection_graph_.CEnd()) { } BisectionGraphView::BisectionGraphView(const BisectionGraph &bisection_graph_, const BisectionGraph::ConstNodeIterator begin_, const BisectionGraph::ConstNodeIterator end_) : bisection_graph(bisection_graph_), begin(begin_), end(end_) { } BisectionGraphView::BisectionGraphView(const BisectionGraphView &other_view, const BisectionGraph::ConstNodeIterator begin_, const BisectionGraph::ConstNodeIterator end_) : BisectionGraphView(other_view.bisection_graph, begin_, end_) { } std::size_t BisectionGraphView::NumberOfNodes() const { return std::distance(begin, end); } NodeID BisectionGraphView::GetID(const NodeT &node) const { const auto node_id = static_cast(&node - &(*begin)); BOOST_ASSERT(node_id < NumberOfNodes()); return node_id; } BisectionGraph::ConstNodeIterator BisectionGraphView::Begin() const { return begin; } BisectionGraph::ConstNodeIterator BisectionGraphView::End() const { return end; } const BisectionGraphView::NodeT &BisectionGraphView::Node(const NodeID nid) const { return *(begin + nid); } const BisectionGraphView::EdgeT &BisectionGraphView::Edge(const EdgeID eid) const { return bisection_graph.Edge(eid); } } // namespace osrm::partitioner