Dijkstra’s Algorithm (a generalization of breadth-first search) in C#. Declare your own Nodes and Edges to define the graph and let the algorithm find the best path to the target Node.
FloodSpill is a fast multi-purpose flood-fill algorithm for C#. It lets you run a flood in two-dimensional space, configure it with your own conditions and callbacks and choose between FIFO, LIFO or priority-based order for processing positions. Includes possibility of performing scanline-fill for...
More information
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.
