Crate toolbox_rs

source · [−]

Modules

addressable_binary_heap
bfs
bin_pack
bloom_filter
cycle_check
dfs
dimacs
dinic

A Max-Flow computation implementing Cherkassky’s variant of Dinitz’ seminal algorithm. The implementation at hand is distinguished by three factors:

edge
edmonds_karp
ford_fulkerson
geometry
graph
great_circle
inertial_flow
kruskal
max_flow
partition
projection
rdx_sort
static_graph
tarjan
union_find
unsafe_slice
wgs84