A low-level utility for matching a string against a directed acyclic graph of regexes.
An implementation of the Ford-Fulkerson max-flow algorithm.Supports maximum flow as well as minimum-cost maximum flow.
An effective subgraph matching gem based on DualIso algorithm of M. Saltz et al.