Boost.Graph

    • Introduction
    • Primitives
    • Graph Classes
      • Adjacency List
      • Adjacency Matrix
      • Compressed Sparse Row Graph
    • Property Maps
      • Bundled Properties
      • External Properties
      • Internal Tags (Legacy)
      • Common Mistakes
    • Visitors
      • Pre-built Event Visitors
        • Vertex Predecessor Recorder
        • Edge Predecessor Recorder
        • Distance Recorder
        • Property Put
        • Property Writer
        • Time Stamper
        • Null Visitor
      • Algorithm-specific visitors
        • TSP Tour Visitor
        • TSP Tour Len Visitor
        • A* Heuristic (Zero)
      • Concepts
        • BFS Visitor
        • DFS Visitor
        • Dijkstra Visitor
        • Bellman-Ford Visitor
        • A* Visitor
        • A* Heuristic
        • Event Visitor
        • Planar Face Visitor
        • TSP Tour Visitor
        • Add Edge Visitor
      • Algorithm adaptors
        • Event Visitor List
        • BFS Visitor Adaptor
        • DFS Visitor Adaptor
        • Dijkstra Visitor Adaptor
        • Bellman-Ford Visitor Adaptor
        • A* Visitor Adaptor
    • Algorithms
      • Traversal
        • Breadth First Search
        • Breadth First Visit
        • Depth First Search
        • Depth First Visit
        • Undirected DFS
      • Shortest Paths
        • Dijkstra Shortest Paths
        • Dijkstra Shortest Paths No Color Map
        • Bellman-Ford Shortest Paths
        • DAG Shortest Paths
        • Johnson All Pairs Shortest Paths
        • Floyd-Warshall All Pairs Shortest Paths
        • Resource-Constrained Shortest Paths
        • A* Search
      • Spanning Trees
        • Kruskal Minimum Spanning Tree
        • Prim Minimum Spanning Tree
        • Random Spanning Tree
        • Two Graphs Common Spanning Trees
      • Connected Components
        • Connected Components
        • Strong Components
        • Biconnected Components
        • Incremental Components
      • Network Flow
        • Edmonds-Karp Max Flow
        • Push-Relabel Max Flow
        • Boykov-Kolmogorov Max Flow
        • Stoer-Wagner Min Cut
        • Cycle Canceling
        • Successive Shortest Path Nonnegative Weights
        • Find Flow Cost
        • Edmonds Maximum Cardinality Matching
        • Maximum Weighted Matching
      • Topological Sort
        • Topological Sort
      • Graph Coloring
        • Sequential Vertex Coloring
        • Edge Coloring
        • Is Bipartite
        • Find Odd Cycle
      • Connectivity
        • Edge Connectivity
        • ST Connected
      • Graph Metrics
        • PageRank
        • Brandes Betweenness Centrality
        • Degree Centrality
        • Closeness Centrality
        • Eccentricity
        • Geodesic Distance
        • Clustering Coefficient
        • Core Numbers
        • Profile
        • Wavefront
        • Bandwidth
      • Graph Isomorphism
        • Isomorphism
        • VF2 Subgraph Isomorphism
        • McGregor Common Subgraphs
      • Planar Graphs
        • Boyer-Myrvold Planarity Test
        • Planar Face Traversal
        • Planar Canonical Ordering
        • Chrobak-Payne Straight Line Drawing
        • Is Straight Line Drawing
        • Is Kuratowski Subgraph
        • Make Connected
        • Make Biconnected Planar
        • Make Maximal Planar
      • Layout
        • Topologies
        • Random Graph Layout
        • Circle Layout
        • Kamada-Kawai Spring Layout
        • Fruchterman-Reingold Force Directed Layout
        • Gürsoy-Atun Layout
        • Layout Tolerance
      • Sparse Matrix Ordering
        • Cuthill-McKee Ordering
        • King Ordering
        • Minimum Degree Ordering
        • Sloan Ordering
        • Sloan Start End Vertices
      • Cycle Detection
        • Hawick Circuits
        • Tiernan All Cycles
        • Cycle Ratio
      • Clique Detection
        • Bron-Kerbosch All Cliques
      • Utility
        • Copy Graph
        • Transpose Graph
        • Transitive Closure
        • Transitive Reduction
        • Smallest Last Ordering
        • Lengauer-Tarjan Dominator Tree
        • Metric TSP Approximation
        • Maximum Adjacency Search
        • Betweenness Centrality Clustering
        • Disjoint Sets
        • Incident
        • Opposite
        • Neighbor BFS
        • Loop-Erased Random Walk
        • Graph Statistics
    • Concepts
      • Graph Structure
        • Graph
        • Incidence Graph
        • Bidirectional Graph
        • Adjacency Graph
        • Vertex List Graph
        • Edge List Graph
        • Vertex and Edge List Graph
        • Adjacency Matrix
        • Mutable Graph
        • Vertex Mutable Graph
        • Edge Mutable Graph
        • Property Graph
        • Mutable Property Graph
        • Iterator Constructible Graph
      • Property and Value Types
        • Color Value
        • Buffer
        • Basic Matrix
        • Monoid
        • Keyed Updatable Queue
        • Updatable Queue
        • Planar Embedding
        • Property Tag
    • Graph Generators
      • Random Graph Utilities
      • Erdős-Rényi (Uniform Random)
      • Scale-Free (R-MAT)
      • PLOD (Power Law)
      • Small World (Watts-Strogatz)
      • Mesh (2D Grid)
      • SSCA (Clustered Benchmark)
    • Graph I/O
      • GraphViz (DOT)
      • GraphML
      • DIMACS
    • Graph Adaptors
      • Filtered Graph
      • Reverse Graph
      • Subgraph
      • Edge List
      • Grid Graph
    • Traits and Iterators
      • Graph Traits
      • Adjacency List Traits
      • Property Map
      • property
      • Adjacency Iterator
      • Inverse Adjacency Iterator
    • Exceptions
    • Extending the BGL
      • Worked Example: Graph Coloring
      • Custom Adjacency List Storage
      • Adapting Existing Graph Structures
    • About
      • Design Rationale
      • Graph Theory Review
      • Named Parameters
      • Bibliography
      • History
      • Acknowledgements
      • Publications
      • BGL Users
    • FAQ
  • Boost.Graph
  • About
  • BGL Users

Boost Graph Library Users

This is a list of people, projects, courses, companies, and other languages that are using the Boost Graph Library in some way, shape, or form.

If you are using the BGL and want to be listed here, please send mail to the Boost Users mailing list!

  • Generic Software Design Course at RPI

  • The ALPS quantum mechanics project

  • Large Graph Layout at University of Texas

  • Bioinformatics Algorithms at Concordia University

  • Algorithm Course at Polytechnic University in Brooklyn

  • BGL interface for language R.

  • CUJ Article about Electronic Design Automation

  • A BGL-inspired Ruby Graph Library

  • A BGL-inspired C# Graph Library

  • A BGL-inspired Squeak (Smalltalk) Graph Library

  • BGL course at DataSim

  • VR Juggler: Virtual Reality Tools

  • Hyperworx Platform Project

  • OpenCog, an open source Artificial General Intelligence framework

  • pgRouting extends the PostGIS/PostgreSQL geospatial database to provide geospatial routing functionality.