The Boost Graph Library (BGL). Graphs are mathematical abstractions that are useful for solving many types of problems in computer science. Consequently, these abstractions must also be represented in computer programs. A standardized generic interface for traversing graphs is of utmost importance to encourage reuse of graph algorithms and data structures. Part of the Boost Graph Library is a generic interface that allows access to a graph’s structure, but hides the details of the implementation. This is an “open” interface in the sense that any graph library that implements this interface will be interoperable with the BGL generic algorithms and with other algorithms that also use this interface. The BGL provides some general purpose graph classes that conform to this interface, but they are not meant to be the “only” graph classes; there certainly will be other graph classes that are better for certain situations. We believe that the main contribution of the The BGL is the formulation of this interface. The BGL graph interface and graph components are generic, in the same sense as the Standard Template Library (STL) [2]. In the following sections, we review the role that generic programming plays in the STL and compare that to how we applied generic programming in the context of graphs.

References in zbMATH (referenced in 59 articles )

Showing results 41 to 59 of 59.
Sorted by year (citations)
  1. Axelsson, Maria; Svensson, Stina: 3D pore structure characterisation of paper (2010) ioport
  2. Bilgin, Cemal Cagatay; Bullough, Peter; Plopper, George E.; Yener, Bülent: ECM-aware cell-graph mining for bone tissue modeling and classification (2010) ioport
  3. Bodlaender, Hans L.; Koster, Arie M. C. A.: Treewidth computations. I: Upper bounds (2010)
  4. Buluç, Aydın; Gilbert, John R.; Budak, Ceren: Solving path problems on the GPU (2010)
  5. Güler, Çiğdem; Hamacher, Horst W.: Capacity inverse minimum cost flow problem (2010)
  6. Järvi, Jaakko; Marcus, Mat; Smith, Jacob N.: Programming with C++ concepts (2010)
  7. Kempf, T.; Wallentowitz, S.; Ascheid, G.; Leupers, R.; Meyr, H.: Analytical and simulation-based design space exploration of software defined radios (2010)
  8. Martins, D.; Simoni, R.; Carboni, A. P.: Fractionation in planar kinematic chains: reconciling enumeration contradictions (2010)
  9. Pavičić, Mladen; McKay, Brendan D.; Megill, Norman D.; Fresl, Krešimir: Graph approach to quantum systems (2010)
  10. Wuhrer, Stefanie; Brunton, Alan: Segmenting animated objects into near-rigid components (2010) ioport
  11. Edmonds, Nick; Breuer, Alex; Gregor, Douglas; Lumsdaine, Andrew: Single-source shortest paths with the parallel boost graph library (2009)
  12. Hagishita, T.; Ohsaki, M.: Topology optimization of trusses by growing ground structure method (2009) ioport
  13. Zhang, Qinghai; Liu, Philip L.-F.: HyPAM: A hybrid continuum-particle model for incompressible free-surface flows (2009)
  14. Chaoji, Vineet; Hasan, Mohammad Al; Salem, Saeed; Zaki, Mohammed J.: An integrated, generic approach to pattern mining: data mining template library (2008) ioport
  15. Heinzl, René; Schwaha, Philipp; Stimpfl, Franz; Selberherr, Siegfried: Concepts for high-perfomance scientific computing (2008)
  16. Sauter, Michael; Kress, Gerald; Giger, M.; Ermanni, P.: Complex-shaped beam element and graph-based optimization of compliant mechanisms (2008)
  17. Hert, Susan; Hoffmann, Michael; Kettner, Lutz; Pion, Sylvain; Seel, Michael: An adaptable and extensible geometry kernel (2007)
  18. Rineau, Laurent; Yvinec, Mariette: A generic software design for Delaunay refinement meshing (2007)
  19. Wein, Ron; Fogel, Efi; Zukerman, Baruch; Halperin, Dan: Advanced programming techniques applied to CGAL’s arrangement package (2007)