Modules§
- addressable_
binary_ heap - as_
bytes - bfs
- bin_
pack - bit_
weight_ iterator - bitset_
subset_ iterator - bloom_
filter - bounding_
box - cell
- convex_
hull - 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.
- count_
min_ sketch - cycle_
check - ddsg
- dfs
- dimacs
- dinic
- A Max-Flow computation implementing Cherkassky’s variant of Dinitz’ seminal algorithm. The implementation at hand is distinguished by three factors:
- dynamic_
graph - edge
- edmonds_
karp - enumerative_
source_ coding - fenwick
- ford_
fulkerson - geometry
- graph
- great_
circle - huffman_
code - inertial_
flow - io
- k_
way_ merge_ iterator - kruskal
- level_
directory - linked_
list - loser_
tree - lru
- math
- max_
flow - mercator
- Web Mercator projection utilities (EPSG:3857)
- merge_
entry - merge_
tree - metis
- one_
iterator - one_
to_ many_ dijkstra - partition_
id - path_
based_ scc - polyline
- Polyline encoding and decoding utilities
- r_tree
- rdx_
sort - renumbering_
table - run_
iterator - single_
linked_ list - space_
filling_ curve - static_
graph - tabulation_
hash - tarjan
- tiny_
table - top_k
- unidirectional_
dijkstra - union_
find - unsafe_
slice - vector_
tile - Vector tile coordinate handling and conversions
- wgs84
- WGS84 coordinate handling and conversions.