A graph iterator.
An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.
A breadth-first iterator for a directed and an undirected graph.
A closest-first iterator for a directed or undirected graph.
Provides a cross-connected-component traversal functionality for iterator subclasses.
A depth-first iterator for a directed and an undirected graph.
A random-walk iterator for a directed and an undirected graph.
Implements topological order traversal for a directed acyclic graph.
Standard vertex visit state enumeration.
Copyright © 2017. All rights reserved.