Create a helper for topological sorting of the given relations.

Synopsis

Declared in <bdlb_topologicalsortutil.h>

explicit
TopologicalSortUtil_Helper(
    INPUT_ITER relationsBegin,
    INPUT_ITER relationsEnd,
    bslma::Allocator* allocator = 0);

Description

Create a helper class that holds the different data structures required to sort in topological order the directed acyclic graph described by the specified relationsBegin and relationsEnd. Optionally, specify an allocator for needed memory. If allocator is 0, use the globally supply default allocator instead.

Parameters

Name

Description

relationsBegin

beginning of the input edge range

relationsEnd

end of the input edge range

allocator

memory allocator; 0 uses the default allocator

Created with MrDocs