A fast algorithm for comparing sets of polylines (e.g. road networks).
Returns lines matching a pattern in a string. Supports inverse operation as well, to exclude lines with matches.
The core components used for the bvr pager.
Core engine for aaai — audit for asset integrity
Online bipartite matching is a type of matching problem where the goal is to match elements from two disjoint sets (also known as "bipartite graphs"), where one set represents the "left" vertices and the other set represents the "right" vertices.