Boost - Revision history

Daviddoria: /* Boost Examples */

2015-05-12T19:36:21Z

‎Boost Examples

Daviddoria: /* Boost Examples */

2015-05-12T19:36:00Z

‎Boost Examples

Daviddoria: /* Boost (Generic) Geometry Library */

2012-09-25T17:45:23Z

‎Boost (Generic) Geometry Library

Daviddoria: /* Boost Math Library */

2012-09-05T21:34:13Z

‎Boost Math Library

Daviddoria at 18:21, 13 January 2012

2012-01-13T18:21:52Z

Daviddoria: /* Boost Graph Library (BGL) */

2012-01-06T15:42:49Z

‎Boost Graph Library (BGL)

Daviddoria: /* Boost (Generic) Geometry Library */

2012-01-02T16:17:02Z

‎Boost (Generic) Geometry Library

Daviddoria at 14:43, 17 November 2011

2011-11-17T14:43:53Z

Daviddoria: Moving BGL to its own page

2011-11-15T21:12:20Z

Moving BGL to its own page

Awallin: /* Boost Math Library */ uBLAS determinant example

2011-08-14T12:24:29Z

‎Boost Math Library: uBLAS determinant example

@@ Line 5: / Line 5: @@
 * [[CPP/Boost/Bimap|Bidirectional (both ways) map]]
 * [[CPP/Boost/Function|Glorified function pointers (function.hpp and bind.hpp)]]
-* [[CPP/Boost/Function|Function pointers to class functions]]
+* [[CPP/Boost/ClassFunctionPointer|Function pointers to class functions]]
 * [[CPP/Boost/Histogram|Create a histogram (accumulator)]]
 * [[CPP/Boost/Numeric/Matrix|Matrix]]

@@ Line 5: / Line 5: @@
 * [[CPP/Boost/Bimap|Bidirectional (both ways) map]]
 * [[CPP/Boost/Function|Glorified function pointers (function.hpp and bind.hpp)]]
 * [[CPP/Boost/Histogram|Create a histogram (accumulator)]]
 * [[CPP/Boost/Numeric/Matrix|Matrix]]

@@ Line 32: / Line 32: @@
 * [[CPP/Boost/Geometry/PointInPolygon|Determine if a point is inside of a polygon (within() function)]]
 * [[CPP/Boost/Geometry/Simplify|Simplify a polyline]]
 == Boost Iterators ==

← Older revision		Revision as of 21:34, 5 September 2012
Line 42:		Line 42:
	* [[CPP/Boost/Math/Tools/brent_find_minima\|brent_find_minima]] Find a bracketed minimum of a function		* [[CPP/Boost/Math/Tools/brent_find_minima\|brent_find_minima]] Find a bracketed minimum of a function
	* [[CPP/Boost/Math/Tools/TOMS748\|TOMS748 root finding algorithm]] Find a bracketed root(zero) of a function		* [[CPP/Boost/Math/Tools/TOMS748\|TOMS748 root finding algorithm]] Find a bracketed root(zero) of a function
		+
		+	== Heap ==
		+	* [[CPP/Boost/Heap/IndirectCompare\|Indirect heap]] Sort a heap by values in a property map

@@ Line 1: / Line 1: @@
 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.
 * [[CPP/Boost/LexicalCast|lexical_cast - a replacement for std::stringstream]]
 * [[CPP/Boost/Bimap|Bidirectional (both ways) map]]

@@ Line 22: / Line 22: @@
 == Boost Graph Library (BGL) ==
-The [[Boost/BGL|Boost Graph Library]] is a c++ library for graph theoretic data structures and algorithms.
+The Boost Graph Library is a c++ library for graph theoretic data structures and algorithms. There are several examples here: [[Boost/BGL|Boost Graph Library Examples]]
 === Wish List ===

@@ Line 21: / Line 21: @@
 == Boost Graph Library (BGL) ==
-=== Basics ===
+The [[Boost/BGL|Boost Graph Library]] is a c++ library for graph theoretic data structures and algorithms.
-* [[CPP/Boost/CreateGraph|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.
-* [[CPP/Boost/BGL/IterateEdges|Iterate over all edges in the graph]]
-* [[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/RemoveVertex|Remove a vertex from a graph]]
-* [[CPP/Boost/RemoveEdge|Remove an edge from a graph]]
-* [[CPP/Boost/BGL/EdgeProperties|Add properties to edges]]
-* [[CPP/Boost/BGL/VertexProperties|Add properties to vertices]]
-* [[CPP/Boost/BGL/BundledProperties|Bundled properties]]
-* [[CPP/Boost/BGL/AdjacentVertices|Get a list of neighboring (adjacent) vertices]]
-* [[CPP/Boost/BGL/DirectedGraph|Directed graphs only give access to 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/BreadthFirstSearch|Breadth first search (BFS with a custom visitor)]]
-* [[CPP/Boost/BGL/MakeBFSVisitor|Breadth first search with make_bfs_visitor]]
-* [[CPP/Boost/BGL/DepthFirstSearch|Depth first search (DFS)]]
-−
-=== I/O ===
-* [[CPP/Boost/BGL/ReadGraph|Read a graph from a file]]
-* [[CPP/Boost/BGL/WriteGraph|Write a graph to a file]]
-* [[CPP/WishList/Boost/BGL/RelabelInputVertices|Relabel input vertices read from a dot file so they match the labels used in the file]]
-−
-=== Algorithms ===
-−
-* [[CPP/Boost/BGL/DijkstraDirected|Find the shortest path (Dijkstra) from a specified vertex to all other vertices in a directed graph]]
-* [[CPP/Boost/BGL/DijkstraUndirected|Find the shortest path (Dijkstra) from a specified vertex to all other vertices in an undirected graph]]
-* [[CPP/Boost/BGL/DijkstraComputePath|Find the shortest path (Dijkstra) from one specified vertex to another specified vertex in a graph]]
-* [[CPP/Boost/BGL/BetweennessCentralityClustering|Cluster a graph using betweenness centrality]]
-−
-=== Visualization ===
-−
-* [[CPP/Boost/BGL/InvisibleEdges|Create a graph with invisible edges]]
 === Wish List ===

@@ Line 65: / Line 65: @@
 == Boost Math Library ==
 === Tools ===
 * [[CPP/Boost/Math/Tools/brent_find_minima|brent_find_minima]] Find a bracketed minimum of a function
 * [[CPP/Boost/Math/Tools/TOMS748|TOMS748 root finding algorithm]] Find a bracketed root(zero) of a function