Arborescence.Traversal (nuget): Graph traversal algorithms: BFS, DFS. Commonly used types: • EnumerableGenericSearch<TVertex, TNeighborEnumerator>, EnumerableGenericSearch<TVertex, TEdge, TEdgeEnumerator> • EnumerableBfs<TVertex, TNeighborEnumerator>, EnumerableBfs<TVertex, TEdge, TEdgeEnumerator> • EnumerableDfs<TVertex, TNeighborEnumerator>, EnumerableDfs<TVertex, TEdge, TEdgeEnumerator> • EagerBfs<TVertex, TEdge, TEdgeEnumerator> • EagerDfs<TVertex, TEdge, TEdgeEnumerator>
Keywords: graph|traversal|bfs|dfs|search