[zem]

most recently, maximum matching over a graph (edmond's blossom algorithm)

[flymaipie]

That actually sounds like a perfect use case for a Rust NIF in Elixir, since graph matching can be a performance issue

[biorach]

> maximum matching over a graph (edmond's blossom algorithm)

Ruby/Rails has this?

[zem]

ruby does indeed, as do python and javascript. here's the ruby library: https://github.com/jaredbeck/graph_matching