operations_research::BidirectionalDijkstra< GraphType, DistanceType > Class Template Reference

Detailed Description

template<typename GraphType, typename DistanceType>
class operations_research::BidirectionalDijkstra< GraphType, DistanceType >

Definition at line 44 of file bidirectional_dijkstra.h.

#include <bidirectional_dijkstra.h>

Classes
struct	NodeDistance
struct	Path

Public Types
typedef GraphType::NodeIndex	NodeIndex
typedef GraphType::ArcIndex	ArcIndex

Public Member Functions
	BidirectionalDijkstra (const GraphType *forward_graph, const std::vector< DistanceType > *forward_arc_lengths, const GraphType *backward_graph, const std::vector< DistanceType > *backward_arc_lengths)
std::string	PathDebugString (const Path &path) const
std::vector< NodeIndex >	PathToNodePath (const Path &path) const
Path	SetToSetShortestPath (const std::vector< NodeDistance > &sources, const std::vector< NodeDistance > &destinations)
Path	OneToOneShortestPath (NodeIndex from, NodeIndex to)

Member Typedef Documentation

ArcIndex

template<typename GraphType, typename DistanceType>

typedef GraphType::ArcIndex operations_research::BidirectionalDijkstra< GraphType, DistanceType >::ArcIndex

Definition at line 47 of file bidirectional_dijkstra.h.

NodeIndex

template<typename GraphType, typename DistanceType>

typedef GraphType::NodeIndex operations_research::BidirectionalDijkstra< GraphType, DistanceType >::NodeIndex

Definition at line 46 of file bidirectional_dijkstra.h.

Constructor & Destructor Documentation

BidirectionalDijkstra()

template<typename GraphType, typename DistanceType>

operations_research::BidirectionalDijkstra< GraphType, DistanceType >::BidirectionalDijkstra	(	const GraphType *	forward_graph,
		const std::vector< DistanceType > *	forward_arc_lengths,
		const GraphType *	backward_graph,
		const std::vector< DistanceType > *	backward_arc_lengths )

Definition at line 184 of file bidirectional_dijkstra.h.

Member Function Documentation

OneToOneShortestPath()

template<typename GraphType, typename DistanceType>

Path operations_research::BidirectionalDijkstra< GraphType, DistanceType >::OneToOneShortestPath ( NodeIndex from, NodeIndex to )

inline

Definition at line 122 of file bidirectional_dijkstra.h.

PathDebugString()

template<typename GraphType, typename DistanceType>

std::string operations_research::BidirectionalDijkstra< GraphType, DistanceType >::PathDebugString

(

const Path &

path

)

const

Definition at line 212 of file bidirectional_dijkstra.h.

PathToNodePath()

template<typename GraphType, typename DistanceType>

std::vector< typename GraphType::NodeIndex > operations_research::BidirectionalDijkstra< GraphType, DistanceType >::PathToNodePath

(

const Path &

path

)

const

Definition at line 230 of file bidirectional_dijkstra.h.

SetToSetShortestPath()

template<typename GraphType, typename DistanceType>

BidirectionalDijkstra< GraphType, DistanceType >::Path operations_research::BidirectionalDijkstra< GraphType, DistanceType >::SetToSetShortestPath	(	const std::vector< NodeDistance > &	sources,
		const std::vector< NodeDistance > &	destinations )

Definition at line 247 of file bidirectional_dijkstra.h.

---

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

• ortools/graph/bidirectional_dijkstra.h