20 template<
typename TNode,
typename TEdge>
23 other(
const TEdge &e,
const TNode &n);
25 template<
typename TNode,
typename TEdge>
28 other(TEdge &e,
const TNode &n);
32 template<
typename TGraph>
34 typename TGraph::edge_type::weight_type
37 template<
typename TCoordinate,
typename TEdge>
42 template<
typename TCoordinate,
typename TEdge>
53template<
typename TNode,
typename TEdge>
56 if (n == e.first)
return e.second;
60template<
typename TNode,
typename TEdge>
63 if (n == e.first)
return e.second;
69template<
typename TGraph>
70typename TGraph::edge_type::weight_type
72 using weight_type =
typename TGraph::edge_type::weight_type;
75 for (
const auto &
edge:
graph.getEdges()) {
76 if (
edge.weight() < eps) {
84template<
typename TCoordinate,
typename TEdge>
87 return graph.getUnit();
90template<
typename TCoordinate,
typename TEdge>
93 return graph.getUnit();
Definition: SupportFunction.hpp:16
static TGraph::edge_type::weight_type getMinEdgeValue(const TGraph &graph)
Definition: SupportFunction.hpp:71
static TNode const & other(const TEdge &e, const TNode &n)
Definition: WeightedSquareGrid4.hpp:18
Definition: WeightedSquareGrid8.hpp:18
Definition: CapacityEdge.hpp:18
constexpr const T & max(const T &a)
Root case of maximum computation. The maximum from one value is the value itself.
Definition: algorithm.hpp:278
Definition: ReconstructPath.hpp:14
Definition: ReconstructPath.hpp:14