.NET package Arborescence.Traversal
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, TVertex, TEdge, TEdgeEnumerator>
Summary
| Count | 13 occurrences |
|---|---|
| State | Dead |
| Last occurred | |
| Habitening next | |
| Age | |
| Average | |
| Honeymoon | |
| Trend | None |
| In degree | 7 |
| Out degree | 75 |
| External links |
|