Weighted B-Matching

Open
#446 6 comments 1 reaction 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
cpp
Domain
data

Research direction

The issue names no files, tests, or entry points; start by reviewing the Boost.Graph codebase and the linked Blossom V paper. Define the intended weighted b-matching API and integration scope before implementation, with completion requiring a reviewed Boost.Graph implementation and corresponding validation.

Written by the indexing model from the issue text.

Description

algorithm

Any plans on implementation of Blossom V or another b-matching algorithm?
I need to use it in my project. Although I can download Vladimir's code, I'd be happy to see it in Boost.
Looks like it is not difficult to rewrite using Boost.Graph codebase. So, the question is: why is it not there yet? I may try to submit a PR if someone else wants it in Boost.

Dominant language
C++
Stars
395
Forks
239
Avg merge
18h 50m
Merged PRs (30d)
20

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from boostorg/graph

All issues in boostorg/graph

Similar issues

More C++ issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.