Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

providing an initial mapping to `mcgregor_common_subgraph`v?

Open
#311 1 comment 0 reactions 0 assignees View on GitHub

Maintainers usually reply within 1 day

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

Start in include/boost/graph/mcgregor_common_subgraphs.hpp around line 414, where the correspondence is initialized empty. Read the surrounding algorithm to identify invariants that a pre-specified mapping must satisfy. Done means the API accepts a heuristic seed mapping without violating those invariants; the issue names no tests to run.

Written by the indexing model from the issue text.

Description

algorithm priority: low

Would it be reasonable to extend functionality so that the user can provide a pre-specified mapping (often determined by some heuristic) as a seed? I noticed that the internals initialize with an empty correspondence:

https://github.com/boostorg/graph/blob/e4e12158e78157397254505f6cbae688e3e3174f/include/boost/graph/mcgregor_common_subgraphs.hpp#L414

So presumably it might not be too hard to allow for an explicit map? Main question is I'm not sure if there's an invariant that would forbid this.

Dominant language
C++
Stars
396
Forks
244
Avg merge
1d 13h
Merged PRs (30d)
26

Getting set up

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.