Boost Graph Library
lastmod 2026-11-10created 2021-03-292 edits
Boost Graph Library (BGL) is a collection of graph data structures and algorithms included in the Boost C++ libraries. It provides several graph representations such as adjacency lists and adjacency matrices as templates, and implements algorithms such as breadth-first and depth-first search, Dijkstra and Bellman-Ford shortest paths, minimum spanning trees, topological sort, and maximum flow through a generic interface. User-defined graph types can also be used with the algorithms as-is, as long as they meet the concept requirements.