Find some connected component within the subset "todo" of this graph.
Declared in <cluster_linearize.h>
SetType
FindConnectedComponent(SetType const& todo) const noexcept;
Specifically, this finds the connected component which contains the first transaction of todo (if any).
Complexity: O(ret.Count()).
A connected component of todo, or the empty set if todo is empty.
| Name | Description |
|---|---|
| todo | The subset of positions to search within. |