Difference between revisions of "Boost"
From ProgrammingExamples
Daviddoria (Talk | contribs) (→Boost Graph Library (BGL)) |
Daviddoria (Talk | contribs) (→Boost Graph Library (BGL)) |
||
| Line 21: | Line 21: | ||
* [[CPP/Boost/BGL/BidirectionalGraph|Bidirectional graphs give access to both in and out edges]] | * [[CPP/Boost/BGL/BidirectionalGraph|Bidirectional graphs give access to both in and out edges]] | ||
* [[CPP/Boost/BGL/NumberOfNeighbors|Number of incoming, outgoing, and total edges]] | * [[CPP/Boost/BGL/NumberOfNeighbors|Number of incoming, outgoing, and total edges]] | ||
| + | * [[CPP/Boost/BGL/BreadthFirstSearch|Breadth first search (BFS)]] | ||
| + | * [[CPP/Boost/BGL/DepthFirstSearch|Depth first search (DFS)]] | ||
Revision as of 17:10, 27 January 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.
- Create a histogram (accumulator)
- Matrix
- Multi dimensional array
- Simple command line argument parsing (ProgramOptions)
- Multiple command line argument parsing (ProgramOptions)
- ProgressBar
- Threads
- Threads with member functions
- ThreadCommunication
- Timer
Boost Graph Library (BGL)
- Create a graph
- Add properties to edges
- Add properties to vertices
- Bundled properties
- Get a list of neighboring (adjacent) vertices
- Directed graphs only give access to out edges
- Bidirectional graphs give access to both in and out edges
- Number of incoming, outgoing, and total edges
- Breadth first search (BFS)
- Depth first search (DFS)
