Hacker News Reader

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

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

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

Ruby/Rails has this?

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