---
name: Feature request
about: Suggest a new algorithm, API addition, or enhancement
title: ''
labels: ''
type: Feature
assignees: ''
---

<!--
Thanks for proposing an addition to Boost.Graph.

If you want to explore an idea or discuss whether a feature would be
worthwhile before committing to a concrete proposal, please start a
GitHub Discussion instead:
https://github.com/boostorg/graph/discussions

This template is for requests with a clear, actionable proposal: a
specific algorithm, API, or enhancement that a maintainer could
reasonably implement or review.
-->

### Before filing

- [ ] I searched the [existing issues](https://github.com/boostorg/graph/issues?q=is%3Aissue) and did not find a duplicate.
- [ ] This is a concrete proposal, not an open-ended design question.

### Kind of addition

- [ ] New algorithm
- [ ] New data structure
- [ ] New property map or utility
- [ ] New I/O format reader or writer
- [ ] Extension to an existing component
- [ ] Performance improvement
- [ ] Other (specify below)

### Motivation

<!--
What problem does this feature solve? Who would use it, and in what
context?
-->

### Proposed addition

<!--
A new algorithm, a new data structure, an extension to an existing
component, or something else? If you have a rough API sketch, paste it
here.
-->

### Relation to existing Boost.Graph components

<!--
Does this overlap with or build on something that already exists in the
library (for example, an existing algorithm or property map)?
-->

### Prior art

- [ ] Reference paper or textbook (cite below)
- [ ] Implementation in another library (link below)
- [ ] None / original idea

References: <!-- paste DOI, ISBN, or URL -->

### Are you willing to contribute?

- [ ] I'd like to submit the implementation as a pull request.
- [ ] I can help with review or testing, but not the implementation.
- [ ] I'm only proposing the idea.
