4 ms·
most recently, maximum matching over a graph (edmond's blossom algorithm)
by zem 2y ago
most recently, maximum matching over a graph (edmond's blossom algorithm)
- flymaipie 2y agoThat actually sounds like a perfect use case for a Rust NIF in Elixir, since graph matching can be a performance issue
- biorach 2y ago> maximum matching over a graph (edmond's blossom algorithm) Ruby/Rails has this?
- zem 2y agoruby does indeed, as do python and javascript. here's the ruby library: https://github.com/jaredbeck/graph_matching https://github.com/jaredbeck/graph_matching