![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
Definition at line 93 of file dag_shortest_path.h.
#include <dag_shortest_path.h>
Public Types | |
| using | NodeIndex = typename GraphType::NodeIndex |
| using | ArcIndex = typename GraphType::ArcIndex |
| using | ArcLengths = ArcLengthContainer |
Public Member Functions | |
| ShortestPathsOnDagWrapper (const GraphType *graph, const ArcLengths *arc_lengths, absl::Span< const NodeIndex > topological_order) | |
| void | RunShortestPathOnDag (absl::Span< const NodeIndex > sources) |
| bool | IsReachable (NodeIndex node) const |
| const std::vector< NodeIndex > & | reached_nodes () const |
| double | LengthTo (NodeIndex node) const |
| std::vector< double > | LengthTo () const |
| std::vector< ArcIndex > | ArcPathTo (NodeIndex node) const |
| std::vector< NodeIndex > | NodePathTo (NodeIndex node) const |
| const GraphType & | graph () const |
| const ArcLengths & | arc_lengths () const |
| using operations_research::ShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::ArcIndex = typename GraphType::ArcIndex |
Definition at line 96 of file dag_shortest_path.h.
| using operations_research::ShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::ArcLengths = ArcLengthContainer |
Definition at line 97 of file dag_shortest_path.h.
| using operations_research::ShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::NodeIndex = typename GraphType::NodeIndex |
Definition at line 95 of file dag_shortest_path.h.
| operations_research::ShortestPathsOnDagWrapper< GraphType, ArcLengths >::ShortestPathsOnDagWrapper | ( | const GraphType * | graph, |
| const ArcLengths * | arc_lengths, | ||
| absl::Span< const NodeIndex > | topological_order ) |
Definition at line 335 of file dag_shortest_path.h.
|
inline |
Definition at line 149 of file dag_shortest_path.h.
| std::vector< typename GraphType::ArcIndex > operations_research::ShortestPathsOnDagWrapper< GraphType, ArcLengths >::ArcPathTo | ( | NodeIndex | node | ) | const |
Definition at line 416 of file dag_shortest_path.h.
|
inline |
Definition at line 148 of file dag_shortest_path.h.
| bool operations_research::ShortestPathsOnDagWrapper< GraphType, ArcLengths >::IsReachable | ( | NodeIndex | node | ) | const |
Definition at line 408 of file dag_shortest_path.h.
|
inline |
Definition at line 137 of file dag_shortest_path.h.
|
inline |
Definition at line 134 of file dag_shortest_path.h.
| std::vector< typename GraphType::NodeIndex > operations_research::ShortestPathsOnDagWrapper< GraphType, ArcLengths >::NodePathTo | ( | NodeIndex | node | ) | const |
Definition at line 436 of file dag_shortest_path.h.
|
inline |
Definition at line 131 of file dag_shortest_path.h.
| void operations_research::ShortestPathsOnDagWrapper< GraphType, ArcLengths >::RunShortestPathOnDag | ( | absl::Span< const NodeIndex > | sources | ) |
Definition at line 364 of file dag_shortest_path.h.