operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer > Class Template Reference

Detailed Description

template<class GraphType, typename ArcLengthContainer = std::vector<double>>
class operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >

Definition at line 171 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
	KShortestPathsOnDagWrapper (const GraphType *graph, const ArcLengths *arc_lengths, absl::Span< const NodeIndex > topological_order, int path_count)
void	RunKShortestPathOnDag (absl::Span< const NodeIndex > sources)
bool	IsReachable (NodeIndex node) const
const std::vector< NodeIndex > &	reached_nodes () const
std::vector< double >	LengthsTo (NodeIndex node) const
std::vector< std::vector< ArcIndex > >	ArcPathsTo (NodeIndex node) const
std::vector< std::vector< NodeIndex > >	NodePathsTo (NodeIndex node) const
const GraphType &	graph () const
const ArcLengths &	arc_lengths () const
int	path_count () const

Member Typedef Documentation

ArcIndex

template<class GraphType, typename ArcLengthContainer = std::vector<double>>

using operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::ArcIndex = typename GraphType::ArcIndex

Definition at line 174 of file dag_shortest_path.h.

ArcLengths

template<class GraphType, typename ArcLengthContainer = std::vector<double>>

using operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::ArcLengths = ArcLengthContainer

Definition at line 175 of file dag_shortest_path.h.

NodeIndex

template<class GraphType, typename ArcLengthContainer = std::vector<double>>

using operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::NodeIndex = typename GraphType::NodeIndex

Definition at line 173 of file dag_shortest_path.h.

Constructor & Destructor Documentation

KShortestPathsOnDagWrapper()

template<class GraphType, typename ArcLengths>

operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengths >::KShortestPathsOnDagWrapper	(	const GraphType *	graph,
		const ArcLengths *	arc_lengths,
		absl::Span< const NodeIndex >	topological_order,
		int	path_count )

Definition at line 451 of file dag_shortest_path.h.

Member Function Documentation

arc_lengths()

template<class GraphType, typename ArcLengthContainer = std::vector<double>>

const ArcLengths & operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::arc_lengths ( ) const

inline

Definition at line 227 of file dag_shortest_path.h.

ArcPathsTo()

template<class GraphType, typename ArcLengths>

std::vector< std::vector< typename GraphType::ArcIndex > > operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengths >::ArcPathsTo

(

NodeIndex

node

)

const

Definition at line 634 of file dag_shortest_path.h.

graph()

template<class GraphType, typename ArcLengthContainer = std::vector<double>>

const GraphType & operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::graph ( ) const

inline

Definition at line 226 of file dag_shortest_path.h.

IsReachable()

template<class GraphType, typename ArcLengths>

bool operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengths >::IsReachable

(

NodeIndex

node

)

const

Definition at line 609 of file dag_shortest_path.h.

LengthsTo()

template<class GraphType, typename ArcLengths>

std::vector< double > operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengths >::LengthsTo

(

NodeIndex

node

)

const

Definition at line 617 of file dag_shortest_path.h.

NodePathsTo()

template<class GraphType, typename ArcLengths>

std::vector< std::vector< typename GraphType::NodeIndex > > operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengths >::NodePathsTo

(

NodeIndex

node

)

const

Definition at line 666 of file dag_shortest_path.h.

path_count()

template<class GraphType, typename ArcLengthContainer = std::vector<double>>

int operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::path_count ( ) const

inline

Definition at line 228 of file dag_shortest_path.h.

reached_nodes()

template<class GraphType, typename ArcLengthContainer = std::vector<double>>

const std::vector< NodeIndex > & operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengthContainer >::reached_nodes ( ) const

inline

Definition at line 210 of file dag_shortest_path.h.

RunKShortestPathOnDag()

template<class GraphType, typename ArcLengths>

void operations_research::KShortestPathsOnDagWrapper< GraphType, ArcLengths >::RunKShortestPathOnDag

(

absl::Span< const NodeIndex >

sources

)

Definition at line 505 of file dag_shortest_path.h.

---

The documentation for this class was generated from the following file:

• ortools/graph/dag_shortest_path.h