Implementation of Andrew’s monotone chain convex hull algorithm The runtime is $O(n\log n)$ by sorting the points lexicographically by their lon/lat coordinates, and by subsequently constructing upper and lower hulls.

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

Crate toolbox_rs

Modules