Difference between revisions of "Boost"

From ProgrammingExamples
Jump to: navigation, search
(Basics)
(Basics)
Line 25: Line 25:
  
 
* [[CPP/Boost/BGL/EdgeExists|Check if an edge exists]] - If it does, you also get the edge_descriptor
 
* [[CPP/Boost/BGL/EdgeExists|Check if an edge exists]] - If it does, you also get the edge_descriptor
 +
* [[CPP/Boost/BGL/CopyAGraph|Copy a graph]]
 
* [[CPP/Boost/BGL/Directed/Weighted|Access an edge]]
 
* [[CPP/Boost/BGL/Directed/Weighted|Access an edge]]
 
* [[CPP/Boost/RemoveVertex|Remove a vertex from a graph]]
 
* [[CPP/Boost/RemoveVertex|Remove a vertex from a graph]]

Revision as of 13:21, 27 June 2011

The following examples are frequent use cases of parts of the Boost (http://www.boost.org/) library. Each example includes a CMakeLists.txt file so it can be easily compiled.

Boost Graph Library (BGL)

Basics

  • Create a graph - This is the most fundamental process of using BGL - creating a graph. This example explains 3 methods of creating a graph, using adjacency_list directly, and also using the directed_graph and undirected_graph subclasses.

I/O

Algorithms

Visualization

Wish List

Examples in this section are either shells or something is wrong with them that must be fixed before they can graduate into real examples.