/srv/osrm/osrm-backend/include/util
Edit: /srv/osrm/osrm-backend/include/util/graph_utils.hpp (3141B)
#ifndef GRAPH_UTILS_HPP
#define GRAPH_UTILS_HPP
#include "util/typedefs.hpp"
#include
#include
namespace osrm::util
{
/// This function checks if the graph (consisting of directed edges) is undirected
template bool isUndirectedGraph(const GraphT &graph)
{
for (auto source = 0u; source < graph.GetNumberOfNodes(); ++source)
{
for (auto edge = graph.BeginEdges(source); edge < graph.EndEdges(source); ++edge)
{
const auto &data = graph.GetEdgeData(edge);
auto target = graph.GetTarget(edge);
BOOST_ASSERT(target != SPECIAL_NODEID);
bool found_reverse = false;
for (auto rev_edge = graph.BeginEdges(target); rev_edge < graph.EndEdges(target);
++rev_edge)
{
auto rev_target = graph.GetTarget(rev_edge);
BOOST_ASSERT(rev_target != SPECIAL_NODEID);
if (rev_target != source)
{
continue;
}
BOOST_ASSERT_MSG(!found_reverse, "Found more than one reverse edge");
found_reverse = true;
}
if (!found_reverse)
{
return false;
}
}
}
return true;
}
/// Since DynamicGraph assumes directed edges we have to make sure we transformed
/// the compressed edge format into single directed edges. We do this to make sure
/// every node also knows its incoming edges, not only its outgoing edges and use the reversed=true
/// flag to indicate which is which.
///
/// We do the transformation in the following way:
///
/// if the edge (a, b) is split:
/// 1. this edge must be in only one direction, so its a --> b
/// 2. there must be another directed edge b --> a somewhere in the data
/// if the edge (a, b) is not split:
/// 1. this edge be on of a --> b od a <-> b
/// (a <-- b gets reducted to b --> a)
/// 2. a --> b will be transformed to a --> b and b <-- a
/// 3. a <-> b will be transformed to a --> b and b --> a
template
std::vector directedEdgesFromCompressed(const std::vector &input_edge_list,
FunctorT copy_data)
{
std::vector output_edge_list;
OutputEdgeT edge;
for (const auto &input_edge : input_edge_list)
{
// edges that are not forward get converted by flipping the end points
BOOST_ASSERT(input_edge.flags.forward);
edge.source = input_edge.source;
edge.target = input_edge.target;
edge.data.reversed = false;
BOOST_ASSERT(edge.source != edge.target);
copy_data(edge, input_edge);
output_edge_list.push_back(edge);
if (!input_edge.flags.is_split)
{
std::swap(edge.source, edge.target);
edge.data.reversed = !input_edge.flags.backward;
output_edge_list.push_back(edge);
}
}
return output_edge_list;
}
} // namespace osrm::util
#endif