Add efficient toposort/dominators structures for partial traversals.

[aborgna-q]

The toposort and dominator algorithms are optimized for full-graph traversals, both using O(#ports) memory.
As these algorithms may be used on restricted regions of the graph or told to ignore parts of the graph (#30), this may end up being pretty wasteful.

We should either replace or provide options that use more efficient internal structures.