util::graph Namespace Reference

Functions
template<class AdjacencyLists >
absl::StatusOr< std::vector< int > >	FastTopologicalSort (const AdjacencyLists &adj)
template<class AdjacencyLists >
absl::StatusOr< std::vector< int > >	FindCycleInGraph (const AdjacencyLists &adj)
std::vector< int >	DenseIntTopologicalSortOrDie (int num_nodes, const std::vector< std::pair< int, int >> &arcs)
std::vector< int >	DenseIntStableTopologicalSortOrDie (int num_nodes, const std::vector< std::pair< int, int >> &arcs)
template<typename T >
std::vector< T >	StableTopologicalSortOrDie (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs)

Function Documentation

DenseIntStableTopologicalSortOrDie()

std::vector<int> util::graph::DenseIntStableTopologicalSortOrDie ( int  num_nodes, const std::vector< std::pair< int, int >> &  arcs  )

inline

Definition at line 603 of file topologicalsorter.h.

DenseIntTopologicalSortOrDie()

std::vector<int> util::graph::DenseIntTopologicalSortOrDie ( int  num_nodes, const std::vector< std::pair< int, int >> &  arcs  )

inline

Definition at line 599 of file topologicalsorter.h.

FastTopologicalSort()

absl::StatusOr< std::vector< int > > FastTopologicalSort

(

const AdjacencyLists &

adj

)

Definition at line 614 of file topologicalsorter.h.

FindCycleInGraph()

absl::StatusOr< std::vector< int > > FindCycleInGraph

(

const AdjacencyLists &

adj

)

Definition at line 655 of file topologicalsorter.h.

StableTopologicalSortOrDie()

std::vector<T> util::graph::StableTopologicalSortOrDie	(	const std::vector< T > &	nodes,
		const std::vector< std::pair< T, T >> &	arcs
	)

Definition at line 608 of file topologicalsorter.h.