Adjacency Matrix and std::mdspan, C++23
Table of Contents
Starting slow
Improving Efficiency with a Single Vector
C++23 MD span
Adjacency Matrix with mdspan
Const Correctness
Rule of Five
Improvements
Implementation notes
Summary
In graph theory, an adjacency matrix is a square matrix used to represent a finite (and usually dense) graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not, and in weighted graphs, they store the edge weights.
In many beginner-level tutorials, adjacency matrices are impleme...
Read more at cppstories.com