BGL
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.
Keywords for this software
References in zbMATH (referenced in 52 articles )
Showing results 1 to 20 of 52.
Sorted by year (- Koster, A. M. C. A.; Scheidweiler, R.; Tieves, M.: A flow based pruning scheme for enumerative equitable coloring algorithms (2019)
- Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
- Vömel, Christof; de Lorenzi, Flavio; Beer, Samuel; Fuchs, Erwin: The secret life of keys: on the calculation of mechanical lock systems (2017)
- Xu, Hong; Satish Kumar, T. K.; Koenig, Sven: The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP (2017)
- Akhmedov, Murodzhon; Kwee, Ivo; Montemanni, Roberto: A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem (2016)
- Andersen, Jakob L.; Flamm, Christoph; Merkle, Daniel; Stadler, Peter F.: A software package for chemically inspired graph transformation (2016)
- Schuppan, Viktor: Enhancing unsatisfiable cores for LTL with information on temporal relevance (2016)
- Schuppan, Viktor: Extracting unsatisfiable cores for LTL via temporal resolution (2016)
- Burger, Alewyn Petrus; de Villiers, Anton Pierre; van Vuuren, Jan Harm: Edge stability in secure graph domination (2015)
- Filar, Jerzy A.; Haythorpe, Michael; Rossomakhine, Serguei: A new heuristic for detecting non-Hamiltonicity in cubic graphs (2015)
- Keiren, Jeroen J. A.: Benchmarks for parity games (2015)
- Kovács, Péter: Minimum-cost flow algorithms: an experimental evaluation (2015)
- Boland, Natashia; Kalinowski, Thomas; Waterer, Hamish; Zheng, Lanbo: Scheduling arc maintenance jobs in a network to maximize total flow over time (2014)
- Bartha, Ferenc A.; Garab, Ábel; Krisztin, Tibor: Local stability implies global stability for the 2-dimensional Ricker map (2013)
- Czado, Claudia; Brechmann, Eike Christian; Gruber, Lutz: Selection of vine copulas (2013)
- Oudinet, Johan; Denise, Alain; Gaudel, Marie-Claude: A new dichotomic algorithm for the uniform random generation of words in regular languages (2013)
- Salzman, Oren; Hemmer, Michael; Raveh, Barak; Halperin, Dan: Motion planning via manifold samples (2013)
- Ursulenko, Oleksii; Butenko, Sergiy; Prokopyev, Oleg A.: A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (2013)
- Andersson, Tommy; Andersson, Christer: Properties of the DGS-auction algorithm (2012)
- Beasley, Ryan A.: Semiautonomous medical image segmentation using seeded cellular automaton plus edge detector (2012) ioport