Top 20 NuGet Packages depending on Graph abstractions

Total dependencies: 2

Graph traversal algorithms: BFS, DFS. Commonly used types: • Adjacency.EnumerableBfs<TVertex, TNeighborEnumerator> • Adjacency.EnumerableDfs<TVertex, TNeighborEnumerator> • Adjacency.EnumerableGenericSearch<TVertex, TNeighborEnumerator> • Adjacency.EagerBfs<TVertex, TNeighborEnumerator> • Adjacency....
Data structures that provide a generic implementation of graph interfaces and collection concepts. Commonly used types: • AdditiveMonoid<T> • AdjacencyEnumerator<TVertex, TEdge, TGraph, TEdgeEnumerator> • IncidenceEnumerator<TVertex, TNeighborEnumerator> • ListAdjacencyGraph<TVertex, TVertexMultimap...