BloombergLP::bdlb::TopologicalSortUtil_Helper::processNextNodeInOrder

Write the next element in order that doesn't have any predecessors into the specified resultOutIter_p output iterator then increment it and return true. If there are still elements left but all of them still have predecessors do nothing and return false. The behavior is undefined unless !d_workSet.empty().