Crate pathfinding [−] [src]

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

Reexports

pub extern crate num_traits;

Common	Common fields.
DenseCapacity	Dense capacity and flow data.
SparseCapacity	Sparse capacity and flow data.
SquareMatrix	Square matrix of an arbitrary type

Representation of capacity and flow data.

astar	Compute a shortest path using the A* search algorithm.
astar_bag	Compute all shortest paths using the A* search algorithm. Whereas `astar` (non-deterministically) returns a single shortest path, `astar_bag` returns all shortest paths (in a non-deterministic order).
bfs	Compute a shortest path using the breadth-first search algorithm.
dfs	Compute a path using the depth-first search algorithm.
dijkstra	Compute a shortest path using the Dijsktra search algorithm.
edmonds_karp	Compute the maximum flow that can go through a directed graph using the Edmonds Karp algorithm.
edmonds_karp_dense	Helper for the `edmonds_karp` function using an adjacency matrix for dense graphs.
edmonds_karp_sparse	Helper for the `edmonds_karp` function using adjacency maps for sparse graphs.
fringe	Compute a shortest path using the Fringe search algorithm.
idastar	Compute a shortest path using the IDA* search algorithm.
kuhn_munkres	Compute the maximum matching between two disjoints sets of vertices using the Kuhn-Munkres algorithm (also known as Hungarian algorithm).
kuhn_munkres_min	Compute the minimum matching between two disjoints sets of vertices using the Kuhn-Munkres algorithm (also known as Hungarian algorithm).

Type alias for Edmonds-Karp result.