|
ABSL_MUST_USE_RESULT bool | DenseIntTopologicalSort (int num_nodes, const std::vector< std::pair< int, int >> &arcs, std::vector< int > *topological_order) |
|
ABSL_MUST_USE_RESULT bool | DenseIntStableTopologicalSort (int num_nodes, const std::vector< std::pair< int, int >> &arcs, std::vector< int > *topological_order) |
|
std::vector< int > | FindCycleInDenseIntGraph (int num_nodes, const std::vector< std::pair< int, int >> &arcs) |
|
template<typename T > |
ABSL_MUST_USE_RESULT bool | TopologicalSort (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order) |
|
template<typename T > |
ABSL_MUST_USE_RESULT bool | StableTopologicalSort (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order) |
|
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 > | TopologicalSortOrDie (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs) |
|
template<typename T > |
std::vector< T > | StableTopologicalSortOrDie (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs) |
|
template<typename T , typename Sorter > |
ABSL_MUST_USE_RESULT bool | RunTopologicalSorter (Sorter *sorter, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order_or_cycle) |
|
template<typename T , typename Sorter > |
ABSL_MUST_USE_RESULT bool | RunTopologicalSorter (Sorter *sorter, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order, std::vector< T > *cycle) |
|
template<bool stable_sort = false> |
ABSL_MUST_USE_RESULT bool | DenseIntTopologicalSortImpl (int num_nodes, const std::vector< std::pair< int, int >> &arcs, std::vector< int > *topological_order) |
|
template<typename T , bool stable_sort = false> |
ABSL_MUST_USE_RESULT bool | TopologicalSortImpl (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order) |
|
template<typename T , typename Sorter > |
std::vector< T > | RunTopologicalSorterOrDie (Sorter *sorter, const std::vector< std::pair< T, T >> &arcs) |
|
template<bool stable_sort = false> |
std::vector< int > | DenseIntTopologicalSortOrDieImpl (int num_nodes, const std::vector< std::pair< int, int >> &arcs) |
|
template<typename T , bool stable_sort = false> |
std::vector< T > | TopologicalSortOrDieImpl (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs) |
|
template<typename T > |
bool | TopologicalSort (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order) |
|
template<typename T > |
bool | StableTopologicalSort (const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order) |
|
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) |
|