-
class
An empty implementation of a graph iterator to minimize the effort required to implement graph
iterators.
class
A breadth-first iterator for a directed or undirected graph.
class
A closest-first iterator for a directed or undirected graph.
class
Provides a cross-connected-component traversal functionality for iterator subclasses.
class
A degeneracy ordering iterator.
class
A depth-first iterator for a directed or undirected graph.
class
A lexicographical breadth-first iterator for an undirected graph.
class
A maximum cardinality search iterator for an undirected graph.
class
A topological ordering iterator for a directed acyclic graph.