1.92

.drone.star

@@ -8,7 +8,7 @@
 # As the yaml syntax for Drone CI is rather limited.
 #
 #
-globalenv={}
+globalenv={'ADD_UBUNTU_TOOLCHAIN_PPA': 'true'}
 linuxglobalimage="cppalliance/droneubuntu1604:1"
 windowsglobalimage="cppalliance/dronevs2019"
 

.github/CODEOWNERS

@@ -0,0 +1,19 @@
+# Code owners for Boost.Graph
+#
+# When a PR is opened, GitHub automatically requests review from the matching
+# owners listed below. The order of rules matters: later, more specific rules
+# override earlier, more general ones.
+#
+# Authoritative maintainer list: meta/libraries.json
+# Contact details: CONTRIBUTING.md#maintainers
+
+# Default reviewers for everything
+*                       @jeremy-murphy @becheler
+
+# Documentation, contributor-facing files, and CI configuration
+/doc/                   @becheler
+/README.md              @becheler
+/CONTRIBUTING.md        @becheler
+/SECURITY.md            @becheler
+/CODE_OF_CONDUCT.md     @becheler
+/.github/               @becheler

.github/ISSUE_TEMPLATE/bug_report.md

@@ -0,0 +1,84 @@
+---
+name: Bug report
+about: Report a defect or unexpected behavior in Boost.Graph
+title: ''
+labels: ''
+type: Bug
+assignees: ''
+---
+
+<!--
+Thank you for taking the time to file a bug report. Please fill in as much
+of the template below as you can. Reports without a reproducer or
+environment details are very hard to triage.
+-->
+
+### Before filing
+
+- [ ] I searched the [existing issues](https://github.com/boostorg/graph/issues?q=is%3Aissue) and did not find a duplicate.
+- [ ] I have reproduced the bug against the `develop` branch or the latest Boost release.
+- [ ] I have a minimal reproducer (or I will paste my full failing code below).
+
+### Boost version
+
+<!--
+You can find the version number in `<boost/version.hpp>`, or by running
+`git log -1` in your local Boost.Graph checkout.
+-->
+
+### Compiler family
+
+- [ ] GCC / g++
+- [ ] Clang / clang++
+- [ ] MSVC (Visual Studio)
+- [ ] Intel / oneAPI
+- [ ] Other (specify below)
+
+Exact compiler version: <!-- e.g. g++ 13.2.0, clang 17.0.6, MSVC 19.39 -->
+
+### Standard library
+
+- [ ] libstdc++
+- [ ] libc++
+- [ ] MSVC STL
+- [ ] Other (specify below)
+
+### Operating system
+
+- [ ] Linux
+- [ ] macOS
+- [ ] Windows
+- [ ] Other (specify below)
+
+### Kind of component affected
+
+- [ ] Graph data structure (e.g. `adjacency_list`, `adjacency_matrix`)
+- [ ] Algorithm (e.g. `dijkstra_shortest_paths`, `breadth_first_search`)
+- [ ] Property map
+- [ ] I/O or file-format reader (e.g. `read_graphml`, `read_graphviz`)
+- [ ] Visitor / event hooks
+- [ ] Other (specify below)
+
+Exact name of the affected component: <!-- e.g. dijkstra_shortest_paths -->
+
+### Steps to reproduce
+
+<!--
+A minimal compiling program that demonstrates the problem is ideal.
+A [Compiler Explorer](https://godbolt.org/z/9Esszr9Ga) link is even better.
+-->
+
+### Expected behavior
+
+### Actual behavior
+
+<!--
+Include compiler error messages or runtime output verbatim, with file and
+line numbers where applicable.
+-->
+
+### Are you willing to help?
+
+- [ ] I'd like to submit a fix as a pull request.
+- [ ] I can help diagnose or test a candidate fix.
+- [ ] I'm only reporting the issue.

.github/ISSUE_TEMPLATE/config.yml

@@ -0,0 +1,9 @@
+blank_issues_enabled: false
+contact_links:
+  - name: Design discussion or open-ended question
+    url: https://github.com/boostorg/graph/discussions
+    about: |
+      For "should we...?" questions, design exploration, or anything not
+      yet a concrete proposal, please start a GitHub Discussion. Issues
+      are reserved for bugs, feature requests with a concrete proposal,
+      and documentation problems.

.github/ISSUE_TEMPLATE/documentation.md

@@ -0,0 +1,59 @@
+---
+name: Documentation issue
+about: Report missing, incorrect, or unclear documentation
+title: ''
+labels: docs
+type: Task
+assignees: ''
+---
+
+<!--
+Documentation problems are real issues. Thanks for taking the time to
+report one.
+-->
+
+### Before filing
+
+- [ ] I searched the [existing issues](https://github.com/boostorg/graph/issues?q=is%3Aissue+label%3Adocs) and did not find a duplicate.
+- [ ] I checked the latest version of the documentation on `develop`.
+
+### Kind of problem
+
+- [ ] Documentation is missing entirely
+- [ ] Documentation is incorrect or out of date
+- [ ] Explanation is unclear or confusing
+- [ ] Example does not compile
+- [ ] Example compiles but does not produce the documented result
+- [ ] Dead link or broken cross-reference
+- [ ] Other (specify below)
+
+### Where is the issue?
+
+<!--
+A link to the page, or the path to the file (for example,
+`doc/quick_tour.html` or `include/boost/graph/dijkstra_shortest_paths.hpp`).
+-->
+
+### What is wrong, missing, or unclear?
+
+<!--
+For example: an example does not compile, an algorithm's complexity is
+not stated, a parameter is undocumented, an explanation is confusing.
+-->
+
+### What did you expect to find?
+
+<!-- What information would have helped you? -->
+
+### Suggested wording (optional)
+
+<!--
+If you already have an idea of what the docs should say, paste a draft
+here.
+-->
+
+### Are you willing to help?
+
+- [ ] I'd like to submit a docs pull request.
+- [ ] I can review a candidate fix.
+- [ ] I'm only reporting the issue.

.github/ISSUE_TEMPLATE/feature_request.md

@@ -0,0 +1,72 @@
+---
+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.

.github/PULL_REQUEST_TEMPLATE.md

@@ -0,0 +1,50 @@
+<!--
+Thanks for contributing to Boost.Graph! A few notes before you fill this in:
+
+* Target the `develop` branch.
+* New contributions must be licensed under the
+  [Boost Software License 1.0](https://www.boost.org/LICENSE_1_0.txt).
+* Please link any related issue with `Fixes #N` or `Refs #N`.
+-->
+
+### Before submitting
+
+- [ ] This PR targets the `develop` branch.
+- [ ] I searched for an existing PR or issue covering the same change.
+- [ ] My contribution is licensed under the Boost Software License 1.0.
+
+### Type of change
+
+- [ ] Bug fix
+- [ ] New feature or API addition
+- [ ] Refactor (no behavior change)
+- [ ] Documentation
+- [ ] Build, CI, or tooling
+- [ ] Other (specify below)
+
+### Does this PR introduce a breaking change?
+
+- [ ] Yes (describe migration impact below)
+- [ ] No
+
+### What this PR does
+
+<!-- A short summary of the change. -->
+
+### Motivation
+
+<!-- Why is this needed? Link related issue with `Fixes #N` or `Refs #N`. -->
+
+### Testing
+
+<!--
+How did you verify the change? Which compilers and standard libraries did
+you build against? Were new tests added under `test/`?
+-->
+
+### Checklist
+
+- [ ] Existing tests pass (`b2` in the `test/` directory).
+- [ ] New behavior is covered by a test, or this is a docs / build / refactor change.
+- [ ] Documentation was updated if user-facing behavior changed.
+- [ ] No new compiler warnings on the platforms I built against.

.github/scripts/warn_table.py

@@ -0,0 +1,48 @@
+#!/usr/bin/env python3
+"""Print a markdown table comparing compiler-warning counts between two CI log archives.
+
+Usage: warn_table.py BASELINE.zip AFTER.zip
+
+A warning is a line matching 'file:line:col: warning:' (clang/gcc) or 'warning Cxxxx'
+(msvc). Linker, "N warnings generated" summary, and CI-runner lines are not counted.
+"""
+import re
+import sys
+import zipfile
+
+WARNING = re.compile(r":\d+:\d+: warning:|warning C\d+")
+
+
+def counts(zip_path):
+    """Map each CI job to its warning count, read from the run's log archive."""
+    result = {}
+    with zipfile.ZipFile(zip_path) as archive:
+        for entry in archive.namelist():
+            # Top-level per-job logs are named like "12_ubuntu (gcc-14, 14).txt".
+            if "/" in entry or not entry.endswith(".txt"):
+                continue
+            job = re.sub(r"^\d+_", "", entry[:-4])
+            log = archive.read(entry).decode("utf-8", "replace")
+            result[job] = sum(1 for line in log.splitlines() if WARNING.search(line))
+    return result
+
+
+def main(baseline_zip, after_zip):
+    baseline = counts(baseline_zip)
+    after = counts(after_zip)
+    print("| Job | Baseline | After | Delta |")
+    print("|-----|---------:|------:|------:|")
+    for job in sorted(baseline.keys() | after.keys()):
+        if "cmake" in job:  # cmake jobs build only the library, they never warn
+            continue
+        before = baseline.get(job, 0)
+        now = after.get(job, 0)
+        diff = now - before
+        delta = f"{diff:+d}" if diff else "0"
+        print(f"| {job} | {before} | {now} | {delta} |")
+
+
+if __name__ == "__main__":
+    if len(sys.argv) != 3:
+        sys.exit("usage: warn_table.py BASELINE.zip AFTER.zip")
+    main(sys.argv[1], sys.argv[2])