Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
util::TopologicalSorter< T, stable_sort, Hash, KeyEqual > Member List

This is the complete list of members for util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >, including all inherited members.

AddEdge(const T &from, const T &to)util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline
AddEdges(const std::vector< std::pair< T, T > > &edges)util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline
AddNode(const T &node)util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline
GetCurrentFringeSize()util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline
GetNext(T *node, bool *cyclic_ptr, std::vector< T > *output_cycle_nodes=nullptr)util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline
operator=(const TopologicalSorter &)=deleteutil::TopologicalSorter< T, stable_sort, Hash, KeyEqual >
StartTraversal()util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline
TopologicalSorter()util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline
TopologicalSorter(const TopologicalSorter &)=deleteutil::TopologicalSorter< T, stable_sort, Hash, KeyEqual >
TraversalStarted() constutil::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline
~TopologicalSorter()util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >inline