Google OR-Tools: TopologicalSorter< T, stable_sort, Hash, KeyEqual
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 604 of file topologicalsorter.h.
#include <topologicalsorter.h>
Inheritance diagram for TopologicalSorter< T, stable_sort, Hash, KeyEqual >:
Additional Inherited Members | |
| Public Member Functions inherited from util::TopologicalSorter< T, stable_sort, Hash, KeyEqual > | |
| TopologicalSorter ()=default | |
| TopologicalSorter (const TopologicalSorter &)=delete | |
| TopologicalSorter & | operator= (const TopologicalSorter &)=delete |
| ~TopologicalSorter ()=default | |
| void | AddNode (const T &node) |
| void | AddEdges (const std::vector< std::pair< T, T > > &edges) |
| 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 |
The documentation for this class was generated from the following file:
- ortools/graph/topologicalsorter.h