Skip to content
/ BGL Public

Repository with code for learning how to use the Boost Graph Library

Notifications You must be signed in to change notification settings

Blargian/BGL

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

24 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Learning Boost Graph Library 💡

This is an opensource project with the aim of creating a repository with useful notes and code examples for learning the Boost Graph Library. BGL is an incredible piece of C++ design, which strives for genericity. Unfortunately this genericity can sometimes make it feel a little challenging to pick up. This project is aimed at lowering the barrier to entry for new comers to BGL. Contributions are welcome, let's learn together!

File Description
kevin-bacon.cpp An example which uses breadth-first search to find the bacon number of actors. (six degrees of Kevin Bacon problem) taken from the BGL book.
kruskal.cpp A basic example of how to use Kruskals algorithm to find the MST. Taken from BGL library examples.
tiny-ewg.cpp Reads in data from a textfile, creates a graph out of it and then finds the minimum spanning tree using Kruskal's algorithm
tiny-ewg-improved.cpp Example by user sehe on stackexchange which makes some simplifications and improvements to the tiny-ewg example

Instructions to get the project working on your local machine can be found here