Graph traversal algorithms: BFS, DFS.
Commonly used types:
• GenericSearch<TGraph, TVertex, TEdge, TEdgeEnumerator>
• EnumerableBfs<TGraph, TVertex, TEdge, TEdgeEnumerator>, EnumerableDfs<TGraph, TVertex, TEdge, TEdgeEnumerator>
• EagerBfs<TGraph, TVertex, TEdge, TEdgeEnumerator>, EagerDfs<TGraph,...
More information