Helper that builds work-set data for a topological sort.
Declared in <bdlb_topologicalsortutil.h>
template<class INPUT_ITER>
class TopologicalSortUtil_Helper;This class template provides data structures required to sort the partial unsorted edges into a total ordered set of nodes. The value type of the nodes(*) must be hashable and equality comparable by bsl::hash, and bsl::equal_to respectively.
* (*) The value type is determined by first getting the iterator's value type using bsl::iterator_traits<INPUT_ITER>::ValueType and then using TopologicalSortUtilEdgeTraits::ValueType on that result.
| Name | Description |
|---|---|
TopologicalSortUtil_Helper [constructor] | Create a helper for topological sorting of the given relations. |
processNextNodeInOrder | Write the next ready node to an output iterator. |
sortImpl | Sort constructed inputs into topological order. |
operator BloombergLP::bslmf::NestedTraitDeclaration<TopologicalSortUtil_Helper, UsesBslmaAllocator> | Nested trait declaration for bslma::UsesBslmaAllocator. |