11 packages returned for Tags:"bfs"

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .NET Standard 2.0 QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
ImVader is a framework for working with graphs. It provides implementation of common graph algorithms: BFS, DFS, Dijkstra and Floyd-Worshell algorithms, topological sort, computing strong components, finding minimum cuts and others.