Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
TopologicalSorter< T, stable_sort, Hash, KeyEqual > Class Template Reference

#include <topologicalsorter.h>

Inheritance diagram for TopologicalSorter< T, stable_sort, Hash, KeyEqual >:
util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >

Additional Inherited Members

Public Member Functions inherited from util::TopologicalSorter< T, stable_sort, Hash, KeyEqual >
 TopologicalSorter ()
 TopologicalSorter (const TopologicalSorter &)=delete
 This type is neither copyable nor movable.
TopologicalSorteroperator= (const TopologicalSorter &)=delete
 ~TopologicalSorter ()
void AddNode (const T &node)
void AddEdges (const std::vector< std::pair< T, T > > &edges)
 Shortcut to AddEdge() in bulk. Not optimized.
void AddEdge (const T &from, const T &to)
bool GetNext (T *node, bool *cyclic_ptr, std::vector< T > *output_cycle_nodes=nullptr)
int GetCurrentFringeSize ()
void StartTraversal ()
bool TraversalStarted () const

Detailed Description

template<typename T, bool stable_sort = false, typename Hash = typename absl::flat_hash_map<T, int>::hasher, typename KeyEqual = typename absl::flat_hash_map<T, int, Hash>::key_equal>
class TopologicalSorter< T, stable_sort, Hash, KeyEqual >

Definition at line 603 of file topologicalsorter.h.


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