Supporting undirected CSR graphs

Assessment

This issue has not been assessed yet.

Description

Problem

Currently, the Boost Graph Library's compressed_sparse_row_graph only supports directed and bidirectional graphs. There are explicit comments in the codebase and documentation indicating that undirected CSR support is a planned but unimplemented feature:

• compressed_sparse_row_graph.hpp:

  At this time, the compressed sparse row graph can only be used to create directed and bidirectional graphs. In the future, undirected CSR graphs will also be supported.

• doc/compressed_sparse_row.html:

  At this time, the CSR graph type only supports directed and bidirectional graphs...

This is problematic for several reasons, e.g. for adjusting performance in my Louvain's implementation algorithm: I can't use Louvain on directed graphs, but I can't use undirected CSR. Consequently a gap exists between BGL implementations and GenLouvain (that uses CSR). Having an undirected CSR could bridge that gap:

Feature Request

Add support for undirected compressed sparse row (CSR) graphs to compressed_sparse_row_graph. This would improve memory efficiency and performance for large undirected graphs, matching the benefits provided for directed graphs.

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

• [draft] Good first issues: start contributing to Boost.Graph here Open
  beginner friendly

  Difficulty 2/5 1-3 hours Newbie friendliness 76/100

  boostorg/graph#593 · 2 comments · Opened Sep 7, 2026

• connected_components called on empty filtered graph Open
  algorithm beginner friendly priority: high

  Difficulty 2/5 1-3 hours Newbie friendliness 68/100

  boostorg/graph#231 · 2 comments · Opened Oct 29, 2020

• Improve disjoint_set data structure Open

  Difficulty 5/5 Over a week Newbie friendliness 30/100

  boostorg/graph#543 · Opened Jul 27, 2026

• State of warnings in CI `develop` Open
  priority: high warning

  boostorg/graph#496 · 3 comments · 1 assignee · Opened Jun 5, 2026

• Implementing personalized PageRank for graph node scoring. Open
  algorithm

  boostorg/graph#493 · 22 comments · 1 reaction · 2 assignees · Opened May 23, 2026

All issues in boostorg/graph

Similar issues

• [Bug] NULL pointer dereference in llm_running_callback (NGZA-AX-LLM #3) Open

  Difficulty 1/5 Under an hour Newbie friendliness 90/100

  AXERA-TECH/ax-llm#77 · Opened Sep 22, 2026

• resume() sends a second HTTP response (400) after a successful resume Open

  Difficulty 1/5 Under an hour Newbie friendliness 90/100

  games-on-whales/wolf#509 · Opened Sep 21, 2026

• pn7160: reader goes permanently deaf — post-read IRQ-low check fails reads that succeeded Open

  Difficulty 2/5 1-3 hours Newbie friendliness 74/100

  esphome/esphome#19452 · Opened Sep 21, 2026

• Eval bug: Ministral-3 tool-calls during reasoning are not processed Open
  bug-unconfirmed

  Difficulty 2/5 1-3 hours Newbie friendliness 76/100

  ggml-org/llama.cpp#29248 · Opened Sep 21, 2026

• run_tests.py fails on windows, but running tests individually works Open

  Difficulty 2/5 1-3 hours Newbie friendliness 74/100

  NVIDIA/cuda-samples#453 · Opened Sep 21, 2026

More C++ issues