{"id":94706,"library":"graph-matching","title":"Graph Matching","description":"Efficient algorithms for maximum cardinality and weighted matchings in undirected graphs.","status":"active","version":"0.2.1","language":"ruby","source_language":null,"source_url":"https://github.com/jaredbeck/graph_matching","tags":["graph","matching","algorithm","combinatorial"],"install":[{"cmd":"gem install graph_matching","lang":"bash","label":"gem install"},{"cmd":"# Gemfile\ngem 'graph_matching', '~> 0.2.1'","lang":"ruby","label":"Gemfile"}],"dependencies":[],"imports":[{"symbol":"GraphMatching","correct":"require 'graph_matching'"}],"quickstart":{"code":"require 'graph_matching'\ng = GraphMatching::Graph::WeightedGraph.new\ng.add_edge(:a, :b, 10)\ng.add_edge(:b, :c, 5)\nm = g.maximum_weighted_matching\nputs m","lang":"ruby","description":"Find maximum weighted matching in a graph"},"warnings":[],"env_vars":null,"search_vec":"'algorithm':4,16 'cardin':7 'combinatori':17 'effici':3 'graph':1,13,14 'match':2,10,15 'maximum':6 'undirect':12 'weight':9","created_at":"2026-06-19T10:11:12.031599+00:00","updated_at":"2026-06-19T10:11:12.031599+00:00","problems":[],"ecosystem":"rubygems","meta_description":null,"install_score":null,"quickstart_score":null,"quickstart_tag":null,"pypi_latest":null,"cli_name":null,"cli_version":null,"type":"library","homepage":"https://github.com/jaredbeck/graph_matching","github":"https://github.com/jaredbeck/graph_matching","docs":"http://www.rubydoc.info/gems/graph_matching/","changelog":null,"pypi":null,"npm":null,"openapi_spec":null,"status_page":null,"smithery":null,"categories":["utility"],"base_url":null,"auth_type":null,"provenance":{"verified_status":null,"verified_at":null,"last_verified":"2026-06-19","next_check":"2026-12-16","install_tag":null}}