util::internal::DenseIntTopologicalSorterTpl< stable_sort > Member List

This is the complete list of members for util::internal::DenseIntTopologicalSorterTpl< stable_sort >, including all inherited members.

AddEdge(int from, int to)	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
AddEdges(absl::Span< const std::pair< int, int > > edges)	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
AddNode(int node_index)	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
AdjacencyList typedef	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
DenseIntTopologicalSorterTpl()	util::internal::DenseIntTopologicalSorterTpl< stable_sort >	inline
DenseIntTopologicalSorterTpl(int num_nodes)	util::internal::DenseIntTopologicalSorterTpl< stable_sort >	inlineexplicit
DenseIntTopologicalSorterTpl(const DenseIntTopologicalSorterTpl &)=delete	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
ExtractCycle(std::vector< int > *cycle_nodes) const	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
GetCurrentFringeSize()	util::internal::DenseIntTopologicalSorterTpl< stable_sort >	inline
GetNext(int *next_node_index, bool *cyclic, std::vector< int > *output_cycle_nodes=nullptr)	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
operator=(const DenseIntTopologicalSorterTpl &)=delete	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
RemoveDuplicates(std::vector< AdjacencyList > *lists, int skip_lists_smaller_than)	util::internal::DenseIntTopologicalSorterTpl< stable_sort >	static
StartTraversal()	util::internal::DenseIntTopologicalSorterTpl< stable_sort >
TraversalStarted() const	util::internal::DenseIntTopologicalSorterTpl< stable_sort >	inline