Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor > Member List

This is the complete list of members for operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >, including all inherited members.

arc_from_source() constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
arc_lengths() constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
ArcPathTo(int node) constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
ArcPathToNode(int node) constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
BoundedDijkstraWrapper(const GraphType *graph, const std::vector< DistanceType > *arc_lengths)operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
BoundedDijkstraWrapper(const GraphType *graph, ArcLengthFunctor arc_length_functor)operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
distance_type typedefoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
distances() constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
GetArcLength(int arc) constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
GetDestinationIndex(int node) constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
GetSourceIndex(int node) constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
graph() constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
IsReachable(int node) constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
node_type typedefoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
NodePathTo(int node) constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
OneToOneShortestPath(int from, int to, DistanceType distance_limit)operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
parents() constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
reached_nodes() constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
RunBoundedDijkstra(int source_node, DistanceType distance_limit)operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >inline
RunBoundedDijkstraFromMultipleSources(const std::vector< std::pair< int, DistanceType > > &sources_with_distance_offsets, DistanceType distance_limit)operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
RunBoundedDijkstraFromMultipleSourcesToMultipleDestinations(const std::vector< std::pair< int, DistanceType > > &sources_with_distance_offsets, const std::vector< std::pair< int, DistanceType > > &destinations_with_distance_offsets, int num_destinations_to_reach, DistanceType distance_limit)operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
RunBoundedDijkstraWithSettledNodeCallback(const std::vector< std::pair< int, DistanceType > > &sources_with_distance_offsets, std::function< void(node_type settled_node, DistanceType settled_distance, DistanceType *distance_limit)> settled_node_callback, DistanceType distance_limit)operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >
SourceOfShortestPathToNode(int node) constoperations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >