Crate pathfinding [−] [src]

This crate implements several pathfinding, flow, and graph algorithms.

Re-exports

pub extern crate num_traits;

astar	Compute a shortest path (or all shorted paths) using the A* search algorithm.
bfs	Compute a shortest path using the breadth-first search algorithm.
connected_components	Separate components of an undirected graph into disjoint sets.
dfs	Compute a path using the depth-first search algorithm.
dijkstra	Compute a shortest path using the Dijkstra search algorithm.
edmonds_karp	Compute the maximum flow that can go through a directed graph using the Edmonds Karp algorithm.
fringe	Compute a shortest path using the Fringe search algorithm.
grid	Rectangular grid in which vertices can be added or removed, with or without diagonal links.
idastar	Compute a shortest path using the IDA* search algorithm.
kuhn_munkres	Compute a maximum weight maximum matching between two disjoints sets of vertices using the Kuhn-Munkres algorithm (also known as Hungarian algorithm).
matrix	Matrix of an arbitrary type and utilities to rotate, transpose, etc.
prelude	Export all public functions and structures for an easy access.
topological_sort	Find a topological order in a directed graph if one exists.
utils	Miscellaneous utilities