diff --git a/doc/bc_clustering.html b/doc/bc_clustering.html index 14fefb4b..261dfa0b 100644 --- a/doc/bc_clustering.html +++ b/doc/bc_clustering.html @@ -61,7 +61,7 @@ clustering based on edge betweenness centrality.Description
This algorithm implements graph clustering based on edge betweenness centrality. It is an iterative algorithm, where in each -step it compute the edge betweenness centrality (via brandes_betweenness_centrality) and removes the edge with the maximum betweenness centrality. The done function object determines diff --git a/doc/bellman_visitor.html b/doc/bellman_visitor.html index bd6eb9b5..72dae162 100644 --- a/doc/bellman_visitor.html +++ b/doc/bellman_visitor.html @@ -22,7 +22,7 @@ bellman_visitor<EventVisitorList> This class is an adapter that converts a list of EventVisitor's (constructed using +href="./EventVisitor.html">EventVisitors (constructed using std::pair) into a BellmanFordVisitor. @@ -63,7 +63,7 @@ with std::pair. This class implements all of the member functions required by BellmanFordVisitor. In each function the appropriate event is dispatched to the EventVisitor's in the EventVisitorList. +href="./EventVisitor.html">EventVisitor in the EventVisitorList.
Non-Member Functions
diff --git a/doc/bfs_visitor.html b/doc/bfs_visitor.html index 751a742a..b175ac96 100644 --- a/doc/bfs_visitor.html +++ b/doc/bfs_visitor.html @@ -22,7 +22,7 @@ bfs_visitor<EventVisitorList> This class is an adapter that converts a list of EventVisitor's (constructed using +href="./EventVisitor.html">EventVisitors (constructed using std::pair) into a BFSVisitor. @@ -80,7 +80,7 @@ with std::pair. This class implements all of the member functions required by BFSVisitor. In each function the appropriate event is dispatched to the EventVisitor's in the EventVisitorList. +href="./EventVisitor.html">EventVisitor in the EventVisitorList.Non-Member Functions
diff --git a/doc/dfs_visitor.html b/doc/dfs_visitor.html index 9c3fb1a2..990117c6 100644 --- a/doc/dfs_visitor.html +++ b/doc/dfs_visitor.html @@ -22,7 +22,7 @@ dfs_visitor<EventVisitorList> This class is an adapter that converts a list of EventVisitor's (constructed using +href="./EventVisitor.html">EventVisitors (constructed using std::pair) into a DFSVisitor. @@ -63,7 +63,7 @@ with std::pair. This class implements all of the member functions required by DFSVisitor. In each function the appropriate event is dispatched to the EventVisitor's in the EventVisitorList. +href="./EventVisitor.html">EventVisitor in the EventVisitorList.Non-Member Functions
diff --git a/doc/dijkstra_visitor.html b/doc/dijkstra_visitor.html index 80b00af9..1e7ec036 100644 --- a/doc/dijkstra_visitor.html +++ b/doc/dijkstra_visitor.html @@ -22,7 +22,7 @@ dijkstra_visitor<EventVisitorList> This class is an adapter that converts a list of EventVisitor's (constructed using +href="./EventVisitor.html">EventVisitors (constructed using std::pair) into a DijkstraVisitor. @@ -77,7 +77,7 @@ with std::pair. This class implements all of the member functions required by DijkstraVisitor. In each function the appropriate event is dispatched to the EventVisitor's in the EventVisitorList. +href="./EventVisitor.html">EventVisitor in the EventVisitorList.Non-Member Functions
diff --git a/doc/distance_recorder.html b/doc/distance_recorder.html index e10e3f57..fe7cd559 100644 --- a/doc/distance_recorder.html +++ b/doc/distance_recorder.html @@ -27,7 +27,7 @@ href="property_map.html">property map) from some source vertex during a graph search. When applied to edge e = (u,v), the distance of v is recorded to be one more than the distance of u. The distance recorder is typically used with -the on_tree_edge or on_relax_edge events, and +the on_tree_edge or on_relax_edge events and cannot be used with vertex events.@@ -64,7 +64,7 @@ See the example for bfs_visitor.
DistanceMap A WritablePropertyMap, +href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap where the key type and the value type are the vertex descriptor type of the graph. diff --git a/doc/predecessor_recorder.html b/doc/predecessor_recorder.html index ab1d4d47..75fe44a6 100644 --- a/doc/predecessor_recorder.html +++ b/doc/predecessor_recorder.html @@ -27,7 +27,7 @@ map. This is particularly useful in graph search algorithms where recording the predecessors is an efficient way to encode the search tree that was traversed during the search. The predecessor recorder is typically used with the on_tree_edge or -on_relax_edge events, and cannot be used with vertex events. +on_relax_edge events and cannot be used with vertex events.predecessor_recorder can be used with graph algorithms by @@ -40,12 +40,12 @@ visitor can be combined with other event visitors using
Algorithms such as Dijkstra's and breadth-first search will not assign a predecessor to the source vertex (which is the root of the search -tree). Often times it is useful to initialize the source vertex's +tree). It is often useful to initialize the source vertex's predecessor to itself, thereby identifying the root vertex as the only vertex which is its own parent. When using an algorithm like -depth-first search that creates a forest (multiple search trees), it -is useful to intialize the predecessor of every vertex to itself, so -that all the root nodes can be distinguished. +depth-first search that creates a forest (multiple search trees) it +is useful to intialize the predecessor of every vertex to itself. This +way all the root nodes can be distinguished.
Example
@@ -74,7 +74,7 @@ See the example for bfs_visitor.PredecessorMap A WritablePropertyMap, +href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap where the key type and the value type are the vertex descriptor type of the graph. diff --git a/doc/property_writer.html b/doc/property_writer.html index a53ef0ab..fce17995 100644 --- a/doc/property_writer.html +++ b/doc/property_writer.html @@ -74,9 +74,9 @@ href="../example/dave.cpp">examples/dave.cpp.PropertyMap A ReadablePropertyMap, +href="../../property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap where the key_type is the vertex descriptor type or edge -descriptor of the graph (depending on the kind of event tag), and +descriptor of the graph (depending on the kind of event tag) and the value_type of the property is convertible to the value_type of the OutputIterator. diff --git a/doc/time_stamper.html b/doc/time_stamper.html index 6689af28..e2f69f23 100644 --- a/doc/time_stamper.html +++ b/doc/time_stamper.html @@ -74,9 +74,9 @@ The following example shows the usage of the time_stamper.TimeMap A WritablePropertyMap, +href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap where the key_type is the vertex descriptor type or edge -descriptor of the graph (depending on the kind of event tag), and +descriptor of the graph (depending on the kind of event tag) and where the TimeT type is convertible to the value_type of the time property map. @@ -85,7 +85,7 @@ where the TimeT type is convertible to thediff --git a/doc/visitor_concepts.html b/doc/visitor_concepts.html index 4053282b..b68bd69c 100644 --- a/doc/visitor_concepts.html +++ b/doc/visitor_concepts.html @@ -40,6 +40,8 @@ the following visitor concepts: TimeT -The type for the time counter, which should be convertible to the +The type for the time counter which should be convertible to the value_type of the time property map diff --git a/doc/tsp_tour_len_visitor.html b/doc/tsp_tour_len_visitor.html index 8136ad14..4363a3ae 100644 --- a/doc/tsp_tour_len_visitor.html +++ b/doc/tsp_tour_len_visitor.html @@ -102,7 +102,7 @@ template <typename Graph, typename WeightMap, typename OutputIterator, typena tsp_tour_len_visitor<OutputIterator>
make_tsp_tour_len_visitor(Graph const& g, OutIter iter, Length& l, WeightMap map)-Returns a tour_len_visitor that records the TSP tour in the OutputIterator parameter and the tour's length in the Length parameter. +Returns a tour_len_visitor that records the TSP tour in the OutputIterator parameter and the length of the tour in the Length parameter.