Boost Graph Library
Boost Graph Library (BGL) is a library that provides Boost graph functions by including in a header.
The Boost Graph Library (BGL) algorithms consist of algorithms like:
- Breadth First Search
- Depth First Search
- Uniform Cost Search
The basic implementation of boost graph algorithms is based on the above 3 algorithms, But now BG algorithms in the BGL include:
- Dijkstra’s Shortest Paths
- Bellman-Ford Shortest Paths
- Johnson’s All-Pairs Shortest Paths
- Kruskal’s Minimum Spanning Tree
- Prim’s Minimum Spanning Tree
- Connected Components
- Strongly Connected Components
- Dynamic Connected Components (using Disjoint Sets)
- Topological Sort
- Transpose
- Reverse Cuthill Mckee Ordering
- Smallest Last Vertex Ordering
- Sequential Vertex Coloring