Graph traversal algorithms NuGet Package

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.EagerDfs<TVertex, TNeighborEnumerator>
• Incidence.EnumerableBfs<TVertex, TEdge, TEdgeEnumerator>
• Incidence.EnumerableDfs<TVertex, TEdge, TEdgeEnumerator>
• Incidence.EnumerableGenericSearch<TVertex, TEdge, TEdgeEnumerator>
• Incidence.EagerBfs<TVertex, TEdge, TEdgeEnumerator>
• Incidence.EagerDfs<TVertex, TEdge, TEdgeEnumerator>.




Got any Graph traversal algorithms Question?





Info

Version: 0.17.0
Author(s): Viktor T.
Last Update: Thursday, January 11, 2024
.NET Fiddle: Create the first Fiddle
NuGet Url: https://www.nuget.org/packages/Arborescence.Traversal


Install
Install-Package Arborescence.Traversal
dotnet add package Arborescence.Traversal
paket add Arborescence.Traversal
Arborescence.Traversal Download (Unzip the "nupkg" after downloading)

.NETStandard 1.3 .NETStandard 2.0 net461 netcoreapp2.1 netstandard2.1


Tags



STATS

must-have-score

.8

avg-downloads-per-day

4

days-since-last-release

318