Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r53475 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2009-05-30 21:33:01

Next message: jewillco_at_[hidden]: "[Boost-commit] svn:boost r53476 - in trunk/libs: . parameter/doc parameter/doc/html"
Previous message: jewillco_at_[hidden]: "[Boost-commit] svn:boost r53474 - in trunk/libs/property_map: . doc example"

Author: jewillco
Date: 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
New Revision: 53475
URL: http://svn.boost.org/trac/boost/changeset/53475

Log:
Fixed links to property_map library
Text files modified:
   trunk/libs/graph/doc/AStarVisitor.html | 2 +-
   trunk/libs/graph/doc/AddEdgeVisitor.html | 2 +-
   trunk/libs/graph/doc/DijkstraVisitor.html | 4 ++--
   trunk/libs/graph/doc/PlanarEmbedding.html | 2 +-
   trunk/libs/graph/doc/PropertyGraph.html | 4 ++--
   trunk/libs/graph/doc/PropertyTag.html | 2 +-
   trunk/libs/graph/doc/adjacency_list.html | 6 +++---
   trunk/libs/graph/doc/astar_search.html | 12 ++++++------
   trunk/libs/graph/doc/bc_clustering.html | 4 ++--
   trunk/libs/graph/doc/bellman_ford_shortest.html | 6 +++---
   trunk/libs/graph/doc/betweenness_centrality.html | 24 ++++++++++++------------
   trunk/libs/graph/doc/biconnected_components.html | 16 ++++++++--------
   trunk/libs/graph/doc/boyer_myrvold.html | 4 ++--
   trunk/libs/graph/doc/breadth_first_search.html | 6 +++---
   trunk/libs/graph/doc/breadth_first_visit.html | 2 +-
   trunk/libs/graph/doc/bundles.html | 2 +-
   trunk/libs/graph/doc/circle_layout.html | 2 +-
   trunk/libs/graph/doc/connected_components.html | 8 ++++----
   trunk/libs/graph/doc/constructing_algorithms.html | 4 ++--
   trunk/libs/graph/doc/copy_graph.html | 4 ++--
   trunk/libs/graph/doc/dag_shortest_paths.html | 14 +++++++-------
   trunk/libs/graph/doc/depth_first_search.html | 6 +++---
   trunk/libs/graph/doc/depth_first_visit.html | 2 +-
   trunk/libs/graph/doc/dijkstra_shortest_paths.html | 14 +++++++-------
   trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html | 10 +++++-----
   trunk/libs/graph/doc/distance_recorder.html | 2 +-
   trunk/libs/graph/doc/edmonds_karp_max_flow.html | 16 ++++++++--------
   trunk/libs/graph/doc/floyd_warshall_shortest.html | 2 +-
   trunk/libs/graph/doc/fruchterman_reingold.html | 4 ++--
   trunk/libs/graph/doc/gursoy_atun_layout.html | 6 +++---
   trunk/libs/graph/doc/howard_cycle_ratio.html | 2 +-
   trunk/libs/graph/doc/is_kuratowski_subgraph.html | 2 +-
   trunk/libs/graph/doc/is_straight_line_drawing.html | 4 ++--
   trunk/libs/graph/doc/isomorphism.html | 8 ++++----
   trunk/libs/graph/doc/johnson_all_pairs_shortest.html | 8 ++++----
   trunk/libs/graph/doc/kamada_kawai_spring_layout.html | 6 +++---
   trunk/libs/graph/doc/kevin_bacon.html | 2 +-
   trunk/libs/graph/doc/kolmogorov_max_flow.html | 14 +++++++-------
   trunk/libs/graph/doc/kruskal_min_spanning_tree.html | 12 ++++++------
   trunk/libs/graph/doc/lengauer_tarjan_dominator.htm | 6 +++---
   trunk/libs/graph/doc/make_biconnected_planar.html | 2 +-
   trunk/libs/graph/doc/make_connected.html | 2 +-
   trunk/libs/graph/doc/make_maximal_planar.html | 6 +++---
   trunk/libs/graph/doc/maximum_matching.html | 6 +++---
   trunk/libs/graph/doc/metric_tsp_approx.html | 4 ++--
   trunk/libs/graph/doc/minimum_degree_ordering.html | 10 +++++-----
   trunk/libs/graph/doc/planar_canonical_ordering.html | 2 +-
   trunk/libs/graph/doc/planar_face_traversal.html | 2 +-
   trunk/libs/graph/doc/planar_graphs.html | 2 +-
   trunk/libs/graph/doc/predecessor_recorder.html | 2 +-
   trunk/libs/graph/doc/prim_minimum_spanning_tree.html | 14 +++++++-------
   trunk/libs/graph/doc/property_map.html | 6 +++---
   trunk/libs/graph/doc/property_writer.html | 2 +-
   trunk/libs/graph/doc/push_relabel_max_flow.html | 8 ++++----
   trunk/libs/graph/doc/quick_tour.html | 2 +-
   trunk/libs/graph/doc/r_c_shortest_paths.html | 4 ++--
   trunk/libs/graph/doc/random_layout.html | 2 +-
   trunk/libs/graph/doc/read_dimacs.html | 4 ++--
   trunk/libs/graph/doc/sequential_vertex_coloring.html | 2 +-
   trunk/libs/graph/doc/stanford_graph.html | 8 ++++----
   trunk/libs/graph/doc/straight_line_drawing.html | 6 +++---
   trunk/libs/graph/doc/strong_components.html | 16 ++++++++--------
   trunk/libs/graph/doc/table_of_contents.html | 2 +-
   trunk/libs/graph/doc/time_stamper.html | 2 +-
   trunk/libs/graph/doc/topological_sort.html | 6 +++---
   trunk/libs/graph/doc/transitive_closure.html | 2 +-
   trunk/libs/graph/doc/transpose_graph.html | 4 ++--
   trunk/libs/graph/doc/tsp_tour_len_visitor.html | 2 +-
   trunk/libs/graph/doc/undirected_dfs.html | 8 ++++----
   trunk/libs/graph/doc/using_property_maps.html | 2 +-
   trunk/libs/graph/doc/write-graphviz.html | 2 +-
   trunk/libs/graph/doc/write_dimacs.html | 4 ++--
   72 files changed, 201 insertions(+), 201 deletions(-)

Modified: trunk/libs/graph/doc/AStarVisitor.html
==============================================================================
--- trunk/libs/graph/doc/AStarVisitor.html (original)
+++ trunk/libs/graph/doc/AStarVisitor.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -70,7 +70,7 @@
<TR>
<TD><tt>WeightMap</tt></TD>
<TD>A type that is a model of <a
-href="../../property_map/ReadablePropertyMap.html">Readable Property
+href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
Map</a>.</TD>
</TR>

Modified: trunk/libs/graph/doc/AddEdgeVisitor.html
==============================================================================
--- trunk/libs/graph/doc/AddEdgeVisitor.html (original)
+++ trunk/libs/graph/doc/AddEdgeVisitor.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -106,7 +106,7 @@
<tt>add_edge(u, v, g)</tt>.
<li><tt>edge_index_update_visitor</tt>: The constructor of this class takes
two arguments: the first, an EdgeIndexMap,
-is a <a href="../../property_map/ReadWritePropertyMap.html">
+is a <a href="../../property_map/doc/ReadWritePropertyMap.html">
ReadWritePropertyMap</a> that maps each edge in the associated graph
<tt>g</tt> to a distinct integer in the range <tt>[0, num_edges(g))</tt>.
The second argument is the number of edges in the underlying graph, which

Modified: trunk/libs/graph/doc/DijkstraVisitor.html
==============================================================================
--- trunk/libs/graph/doc/DijkstraVisitor.html (original)
+++ trunk/libs/graph/doc/DijkstraVisitor.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -65,7 +65,7 @@

<TR>
<TD><tt>DistanceMap</tt></TD>
-<TD>A type that is a model of Read/Write Property Map.</TD>
+<TD>A type that is a model of Read/Write Property Map.</TD>
</TR>

<TR>
@@ -75,7 +75,7 @@

<TR>
<TD><tt>WeightMap</tt></TD>
-<TD>A type that is a model of Readable Property Map.</TD>
+<TD>A type that is a model of Readable Property Map.</TD>
</TR>

<TR>

Modified: trunk/libs/graph/doc/PlanarEmbedding.html
==============================================================================
--- trunk/libs/graph/doc/PlanarEmbedding.html (original)
+++ trunk/libs/graph/doc/PlanarEmbedding.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -27,7 +27,7 @@
they are to be drawn around that vertex.

A planar embedding is a refinement of
-LValuePropertyMap that
+LValuePropertyMap that
places additional restrictions the <tt>value_type</tt> used in the property
map.

Modified: trunk/libs/graph/doc/PropertyGraph.html
==============================================================================
--- trunk/libs/graph/doc/PropertyGraph.html (original)
+++ trunk/libs/graph/doc/PropertyGraph.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -90,7 +90,7 @@
<td><pre>boost::property_map<G, PropertyTag>::type</pre>
The type of the property map for the property specified by
<TT>PropertyTag</TT>. This type must be a model of <a
-href="../../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
+href="../../property_map/doc/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
with a key type the same as the graph's vertex or edge descriptor type.
</td>
</tr>
@@ -99,7 +99,7 @@
<td><pre>boost::property_map<G, PropertyTag>::const_type</pre>
The type of the const property map for the property specified by
<TT>PropertyTag</TT>. This type must be a model of <a
-href="../../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a>
+href="../../property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap</a>
with a key type the same as the graph's vertex or edge descriptor type.
</td>
</tr>

Modified: trunk/libs/graph/doc/PropertyTag.html
==============================================================================
--- trunk/libs/graph/doc/PropertyTag.html (original)
+++ trunk/libs/graph/doc/PropertyTag.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -96,7 +96,7 @@

<a href="./PropertyGraph.html">PropertyGraph</a>
and
-Property Map Concepts
+Property Map Concepts

<h3>Notes</h3>

Modified: trunk/libs/graph/doc/adjacency_list.html
==============================================================================
--- trunk/libs/graph/doc/adjacency_list.html (original)
+++ trunk/libs/graph/doc/adjacency_list.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -175,13 +175,13 @@
HREF="./using_adjacency_list.html#sec:adjacency-list-properties">Internal
Properties </A>. The property maps are objects that implement the
interface defined in Section <A
-HREF="../../property_map/property_map.html">Property Map
+HREF="../../property_map/doc/property_map.html">Property Map
Concepts</A> or may be bundled properties,
which have a more succinct syntax. The types of all property values
must be Copy Constructible, Assignable, and Default Constructible.
The property maps obtained from the
<TT>adjacency_list</TT> class are models of the <a
-href="../../property_map/LvaluePropertyMap.html">Lvalue Property
+href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
Map</a> concept. If the <TT>adjacency_list</TT> is const,
then the property map is constant, otherwise the property
map is mutable.
@@ -194,7 +194,7 @@
removed the indices are adjusted so that they retain these
properties. Some care must be taken when using these indices to access
exterior property storage. The property map for vertex index is a
-model of <a href="../../property_map/ReadablePropertyMap.html">Readable
+model of <a href="../../property_map/doc/ReadablePropertyMap.html">Readable
Property Map</a>.

Modified: trunk/libs/graph/doc/astar_search.html
==============================================================================
--- trunk/libs/graph/doc/astar_search.html (original)
+++ trunk/libs/graph/doc/astar_search.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -256,7 +256,7 @@
 href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
 exception if one of the edges is negative. The type
 <tt>WeightMap</tt> must be a model of <a
- href="../../property_map/ReadablePropertyMap.html"><tt>Readable
+ href="../../property_map/doc/ReadablePropertyMap.html"><tt>Readable
 Property Map</tt></a>. The edge descriptor type of the graph needs
 to be usable as the key type for the weight map. The value type
 for this map must be the same as the value type of the distance
@@ -270,7 +270,7 @@
 num_vertices(g))</tt>. This is necessary for efficient updates of
 the heap data structure when an edge is relaxed. The type
 <tt>VertexIndexMap</tt> must be a model of <a
- href="../../property_map/ReadablePropertyMap.html"><tt>Readable
+ href="../../property_map/doc/ReadablePropertyMap.html"><tt>Readable
 Property Map</tt></a>. The value type of the map must be an integer
 type. The vertex descriptor type of the graph needs to be usable as
 the key type of the map. 
@@ -291,7 +291,7 @@
 <tt>p[u] = u</tt> then <tt>u</tt> is either the start vertex or a
 vertex that is not reachable from the start. The
 <tt>PredecessorMap</tt> type must be a <a
- href="../../property_map/ReadWritePropertyMap.html"><tt>Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html"><tt>Read/Write
 Property Map</tt></a> with key and vertex types the same as the
 vertex descriptor type of the graph. 

@@ -305,7 +305,7 @@
 vertex in the graph <tt>g</tt> is recorded in this property map.
 The shortest path weight is the sum of the edge weights along the
 shortest path. The type <tt>DistanceMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html"><tt>Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html"><tt>Read/Write
 Property Map</tt></a>. The vertex descriptor type of the graph
 needs to be usable as the key type of the distance map. The value
 type of the distance map is the element type of a <a
@@ -329,7 +329,7 @@
 the estimated cost (as returned by the heuristic function
 <tt>h</tt>) from the vertex to a goal. The type <tt>CostMap</tt>
 must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html"><tt>Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html"><tt>Read/Write
 Property Map</tt></a>. The vertex descriptor type of the graph
 needs to be usable as the key type of the distance map. The value
 type of the distance map is the element type of a <a
@@ -358,7 +358,7 @@
 reachable from the source vertex will have been colored black. All
 other vertices will still be white. The type <tt>ColorMap</tt> must
 be a model of <a
- href="../../property_map/ReadWritePropertyMap.html"><tt>Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html"><tt>Read/Write
 Property Map</tt></a>. A vertex descriptor must be usable as the
 key type of the map, and the value type of the map must be a model
 of Color Value.

Modified: trunk/libs/graph/doc/bc_clustering.html
==============================================================================
--- trunk/libs/graph/doc/bc_clustering.html (original)
+++ trunk/libs/graph/doc/bc_clustering.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -96,7 +96,7 @@
 This property map is used to accumulate the betweenness centrality
 of each edge, and is a secondary form of output for the
 algorithm. The type <tt>EdgeCentralityMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>, with the graph's edge descriptor type as its key
 type. The value type of this property map should be the same as the
 value type of the <tt>CentralityMap</tt> property map. 
@@ -114,7 +114,7 @@
 num_vertices(g))</tt>. This is necessary for efficient updates of the
 heap data structure when an edge is relaxed. The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, g)</tt>.

Modified: trunk/libs/graph/doc/bellman_ford_shortest.html
==============================================================================
--- trunk/libs/graph/doc/bellman_ford_shortest.html (original)
+++ trunk/libs/graph/doc/bellman_ford_shortest.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -201,7 +201,7 @@
<blockquote>
 The weight (also know as ``length'' or ``cost'') of each edge in the
 graph. The <tt>WeightMap</tt> type must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The key type for this property map must be the edge
 descriptor of the graph. The value type for the weight map must be
 Addable with the distance map's value type. 
@@ -219,7 +219,7 @@
 u then u is either the source vertex or a vertex that is
 not reachable from the source. The <tt>PredecessorMap</tt> type
 must be a <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> which key and vertex types the same as the vertex
 descriptor type of the graph. 
 Default: <tt>dummy_property_map</tt> 
@@ -232,7 +232,7 @@
 The shortest path weight from the source vertex to each vertex in
 the graph <tt>g</tt> is recorded in this property map. The type
 <tt>DistanceMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The key type of the property map must be the
 vertex descriptor type of the graph, and the value type of the
 distance map must be <a

Modified: trunk/libs/graph/doc/betweenness_centrality.html
==============================================================================
--- trunk/libs/graph/doc/betweenness_centrality.html (original)
+++ trunk/libs/graph/doc/betweenness_centrality.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -141,13 +141,13 @@
UTIL: <tt>IncomingMap incoming</tt>
<blockquote>
 This property map records the set of edges incoming to each vertex that comprise a shortest path from a particular source vertex through this vertex, and is used internally by the algorithm.The <tt>IncomingMap</tt> type must be a <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
 Map</a> whose key type is the same as the vertex descriptor type of
 the graph and whose value type is a Sequence (e.g., an
 <tt>std::vector</tt>) containing edge descriptors. 

 Default: <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>std::vector<Edge></tt>, where
 <tt>Edge</tt> is the edge descriptor type of the graph. 
@@ -161,14 +161,14 @@
 vertex in the graph <tt>g</tt> is recorded in this property map, but
 the result is only used internally. The type <tt>DistanceMap</tt>
 must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The vertex descriptor type of the graph needs to
 be usable as the key type of the distance map. The value type of the
 distance map is the element type of a <a
 href="./Monoid.html">Monoid</a>. 

 Default: <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the <tt>WeightMap</tt>'s value type (or the
 <tt>vertices_size_type</tt> of the graph when no weight map exists)
@@ -182,14 +182,14 @@
<blockquote>
 Property map used internally to accumulate partial betweenness
 centrality results. The type <tt>DependencyMap</tt> must be a model
- of <a href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ of <a href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The vertex descriptor type of the graph needs to
 be usable as the key type of the dependency map. The value type of
 the dependency map must be compatible with the value type of the
 centrality map. 

 Default: <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the <tt>CentralityMap</tt>'s value type of
 size <tt>num_vertices(g)</tt> and using the <tt>vertex_index</tt>
@@ -203,14 +203,14 @@
 Property map used internally to accumulate the number of paths that
 pass through each particular vertex. The type <tt>PathCountMap</tt>
 must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The vertex descriptor type of the graph needs to
 be usable as the key type of the dependency map. The value type of
 the dependency map must be an integral type large enough to store
 the number of paths in the graph. 

 Default: <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the <tt>degree_size_type</tt> of the graph of
 size <tt>num_vertices(g)</tt> and using the <tt>vertex_index</tt>
@@ -225,7 +225,7 @@
 This property map is used to accumulate the betweenness centrality
 of each vertex, and is the primary output of the algorithm. The type
 <tt>CentralityMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>, with the graph's vertex descriptor type as its key
 type. The value type of this property map should be a floating-point
 or rational type. 
@@ -242,7 +242,7 @@
 This property map is used to accumulate the betweenness centrality
 of each edge, and is a secondary form of output for the
 algorithm. The type <tt>EdgeCentralityMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>, with the graph's edge descriptor type as its key
 type. The value type of this property map should be the same as the
 value type of the <tt>CentralityMap</tt> property map. 
@@ -260,7 +260,7 @@
 num_vertices(g))</tt>. This is necessary for efficient updates of the
 heap data structure when an edge is relaxed. The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, g)</tt>.
@@ -278,7 +278,7 @@
 <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
 exception is one of the edges is negative.
 The type <tt>WeightMap</tt> must be a model of
- Readable Property Map. The edge descriptor type of
+ Readable Property Map. The edge descriptor type of
 the graph needs to be usable as the key type for the weight
 map. The value type for this map must be
 the same as the value type of the distance map.

Modified: trunk/libs/graph/doc/biconnected_components.html
==============================================================================
--- trunk/libs/graph/doc/biconnected_components.html (original)
+++ trunk/libs/graph/doc/biconnected_components.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -120,7 +120,7 @@
records which component each edge in the graph belongs to by
recording the component number in the component property map. The
<tt>ComponentMap</tt> type must be a model of <a
-href="../../property_map/WritablePropertyMap.html">Writable Property
+href="../../property_map/doc/WritablePropertyMap.html">Writable Property
Map</a>. The value type shouch be an integer type, preferably the same
as the <tt>edges_size_type</tt> of the graph. The key type must be
the graph's edge descriptor type. 
@@ -147,7 +147,7 @@
 This maps each vertex to an integer in the range <tt>[0,
 num_vertices(g))</tt>. The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, g)</tt> 
@@ -159,12 +159,12 @@
<blockquote>
 The discovery time of each vertex in the depth-first search. The
 type <tt>DiscoverTimeMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The value type of the map must be an integer
 type. The vertex descriptor type of the graph needs to be usable as
 the key type of the map. 
Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>vertices_size_type</tt> of size
 <tt>num_vertices(g)</tt> and using <tt>get(vertex_index, g)</tt> for
@@ -178,12 +178,12 @@
 The low point of each vertex in the depth-first search, which is the
 smallest vertex reachable from a given vertex with at most one back
 edge. The type <tt>LowPointMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The value type of the map must be an integer
 type. The vertex descriptor type of the graph needs to be usable as
 the key type of the map. 
Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>vertices_size_type</tt> of size
 <tt>num_vertices(g)</tt> and using <tt>get(vertex_index, g)</tt> for
@@ -197,11 +197,11 @@
 The predecessor map records the depth first search tree.
 The <tt>PredecessorMap</tt> type
 must be a <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> whose key and value types are the same as the vertex
 descriptor type of the graph. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>vertex_descriptor</tt> of size
 <tt>num_vertices(g)</tt> and using <tt>get(vertex_index, g)</tt> for

Modified: trunk/libs/graph/doc/boyer_myrvold.html
==============================================================================
--- trunk/libs/graph/doc/boyer_myrvold.html (original)
+++ trunk/libs/graph/doc/boyer_myrvold.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -191,7 +191,7 @@
IN <tt>VertexIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps vertices from <tt>g</tt> to distinct integers in the range
<tt>[0, num_vertices(g) )</tt> 
Default: <tt>get(vertex_index,g)</tt> 
@@ -200,7 +200,7 @@
IN <tt>EdgeIndexMap em</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps edges from <tt>g</tt> to distinct integers in the range
<tt>[0, num_edges(g) )</tt> 
Default: <tt>get(edge_index,g)</tt>, but this parameter is only used if

Modified: trunk/libs/graph/doc/breadth_first_search.html
==============================================================================
--- trunk/libs/graph/doc/breadth_first_search.html (original)
+++ trunk/libs/graph/doc/breadth_first_search.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -194,12 +194,12 @@
 function and do your own color initialization.

 The type <tt>ColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's vertex
 descriptor type and the value type of the color map must model
 <a href="./ColorValue.html">ColorValue</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>default_color_type</tt> of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -215,7 +215,7 @@
 num_vertices(g))</tt>. This parameter is only necessary when the
 default color property map is used. The type <tt>VertexIndexMap</tt>
 must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/breadth_first_visit.html
==============================================================================
--- trunk/libs/graph/doc/breadth_first_visit.html (original)
+++ trunk/libs/graph/doc/breadth_first_visit.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -87,7 +87,7 @@
<blockquote>
 This is used by the algorithm to keep track of its progress through
 the graph. The type <tt>ColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's vertex
 descriptor type and the value type of the color map must model
 <a href="./ColorValue.html">ColorValue</a>.

Modified: trunk/libs/graph/doc/bundles.html
==============================================================================
--- trunk/libs/graph/doc/bundles.html (original)
+++ trunk/libs/graph/doc/bundles.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -147,7 +147,7 @@
 You may also access the entire vertex or edge bundle as a property map
 using the <code>vertex_bundle</code> or <code>edge_bundle</code> properties,
 respectively. For instance, the property map returned by <code>get(vertex_bundle, map)</code> is
- an Lvalue Property Map providing access to the
+ an Lvalue Property Map providing access to the
 <code>City</code> values stored in each vertex.

 <h2>Getting the type of bundled properties</h2>

Modified: trunk/libs/graph/doc/circle_layout.html
==============================================================================
--- trunk/libs/graph/doc/circle_layout.html (original)
+++ trunk/libs/graph/doc/circle_layout.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -23,7 +23,7 @@
<blockquote>
 This property map is used to store the position of each vertex. The
 type <tt>PositionMap</tt> must be a model of <a
- href="../../property_map/WritablePropertyMap.html">Writable Property
+ href="../../property_map/doc/WritablePropertyMap.html">Writable Property
 Map</a>, with the graph's edge descriptor type as its key type. The
 value type of this property map should be assignable from the
 type <tt>Radius</tt>.

Modified: trunk/libs/graph/doc/connected_components.html
==============================================================================
--- trunk/libs/graph/doc/connected_components.html (original)
+++ trunk/libs/graph/doc/connected_components.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -74,7 +74,7 @@
records which component each vertex in the graph belongs to by
recording the component number in the component property map. The
<tt>ComponentMap</tt> type must be a model of <a
-href="../../property_map/WritablePropertyMap.html">Writable Property
+href="../../property_map/doc/WritablePropertyMap.html">Writable Property
Map</a>. The value type shouch be an integer type, preferably the same
as the <tt>vertices_size_type</tt> of the graph. The key type must be
the graph's vertex descriptor type. 
@@ -89,12 +89,12 @@
<blockquote>
 This is used by the algorithm to keep track of its progress through
 the graph. The type <tt>ColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's vertex
 descriptor type and the value type of the color map must model
 <a href="./ColorValue.html">ColorValue</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>default_color_type</tt> of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -109,7 +109,7 @@
 num_vertices(g))</tt>. This parameter is only necessary when the
 default color property map is used. The type <tt>VertexIndexMap</tt>
 must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/constructing_algorithms.html
==============================================================================
--- trunk/libs/graph/doc/constructing_algorithms.html (original)
+++ trunk/libs/graph/doc/constructing_algorithms.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -91,12 +91,12 @@
algorithm the ability to decide how they want to store the properties.
Since we will need to both read and write the colors we specify the
requirements as <a
-href="../../property_map/ReadWritePropertyMap.html">ReadWritePropertyMap</a>. The
+href="../../property_map/doc/ReadWritePropertyMap.html">ReadWritePropertyMap</a>. The
<TT>key_type</TT> of the color map must be the
<TT>vertex_descriptor</TT> from the graph, and the <TT>value_type</TT>
must be some kind of integer. We also specify the interface for the
<TT>order</TT> parameter as a property map, in this case a <a
-href="../../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a>. For
+href="../../property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap</a>. For
order, the <TT>key_type</TT> is an integer offset and the
<TT>value_type</TT> is a <TT>vertex_descriptor</TT>. Again we enforce
these requirements with concept checks. The return value of this

Modified: trunk/libs/graph/doc/copy_graph.html
==============================================================================
--- trunk/libs/graph/doc/copy_graph.html (original)
+++ trunk/libs/graph/doc/copy_graph.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -73,7 +73,7 @@
IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
<blockquote>
The vertex index map type must be a model of <a
-href="../../property_map/ReadablePropertyMap.html">Readable Property
+href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
Map</a> and must map the vertex descriptors of <tt>G</tt> to the
integers in the half-open range <tt>[0,num_vertices(G))</tt>. 

@@ -90,7 +90,7 @@
This maps vertices in the original graph to vertices in the copy.

Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the output graph's vertex descriptor type of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index

Modified: trunk/libs/graph/doc/dag_shortest_paths.html
==============================================================================
--- trunk/libs/graph/doc/dag_shortest_paths.html (original)
+++ trunk/libs/graph/doc/dag_shortest_paths.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -96,7 +96,7 @@
<blockquote>
 The weight or ``length'' of each edge in the graph.
 The type <tt>WeightMap</tt> must be a model of
- Readable Property Map. The edge descriptor type of
+ Readable Property Map. The edge descriptor type of
 the graph needs to be usable as the key type for the weight
 map. The value type for the map must be
 Addable with the value type of the distance map. 
@@ -112,7 +112,7 @@
 num_vertices(g))</tt>. This is necessary for efficient updates of the
 heap data structure when an edge is relaxed. The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, g)</tt>.
@@ -132,7 +132,7 @@
 u then u is either the source vertex or a vertex that is
 not reachable from the source. The <tt>PredecessorMap</tt> type
 must be a <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> which key and vertex types the same as the vertex
 descriptor type of the graph. 
 Default: <tt>dummy_property_map</tt> 
@@ -145,7 +145,7 @@
 vertex in the graph <tt>g</tt> is recorded in this property map. The
 shortest path weight is the sum of the edge weights along the
 shortest path. The type <tt>DistanceMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The vertex descriptor type of the graph needs to
 be usable as the key type of the distance map.

@@ -157,7 +157,7 @@
 StrictWeakOrdering</a> provided by the <tt>compare</tt> function
 object. 
 Default: <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the <tt>WeightMap</tt>'s value type of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -228,12 +228,12 @@
 from the queue. At the end of the algorithm, vertices reachable from
 the source vertex will have been colored black. All other vertices
 will still be white. The type <tt>ColorMap</tt> must be a model of
- <a href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ <a href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. A vertex descriptor must be usable as the key type
 of the map, and the value type of the map must be a model of
 <a href="./ColorValue.html">Color Value</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a <tt>std::vector</tt>
 of <tt>default_color_type</tt> of size <tt>num_vertices(g)</tt> and
 using the <tt>i_map</tt> for the index map.

Modified: trunk/libs/graph/doc/depth_first_search.html
==============================================================================
--- trunk/libs/graph/doc/depth_first_search.html (original)
+++ trunk/libs/graph/doc/depth_first_search.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -185,12 +185,12 @@
<blockquote>
 This is used by the algorithm to keep track of its progress through
 the graph. The type <tt>ColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's vertex
 descriptor type and the value type of the color map must model
 <a href="./ColorValue.html">ColorValue</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>default_color_type</tt> of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -215,7 +215,7 @@
 num_vertices(g))</tt>. This parameter is only necessary when the
 default color property map is used. The type <tt>VertexIndexMap</tt>
 must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/depth_first_visit.html
==============================================================================
--- trunk/libs/graph/doc/depth_first_visit.html (original)
+++ trunk/libs/graph/doc/depth_first_visit.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -96,7 +96,7 @@
<blockquote>
 This is used by the algorithm to keep track of its progress through
 the graph. The type <tt>ColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's vertex
 descriptor type and the value type of the color map map must model
 <a href="./ColorValue.html">Color Value</a>.

Modified: trunk/libs/graph/doc/dijkstra_shortest_paths.html
==============================================================================
--- trunk/libs/graph/doc/dijkstra_shortest_paths.html (original)
+++ trunk/libs/graph/doc/dijkstra_shortest_paths.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -215,7 +215,7 @@
 <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
 exception is one of the edges is negative.
 The type <tt>WeightMap</tt> must be a model of
- Readable Property Map. The edge descriptor type of
+ Readable Property Map. The edge descriptor type of
 the graph needs to be usable as the key type for the weight
 map. The value type for this map must be
 the same as the value type of the distance map. 
@@ -233,7 +233,7 @@
 HREF="bibliography.html#driscoll88">61</A>] when an edge is relaxed.
 The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, g)</tt>.
@@ -254,7 +254,7 @@
 u then u is either the source vertex or a vertex that is
 not reachable from the source. The <tt>PredecessorMap</tt> type
 must be a <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> whose key and value types are the same as the vertex
 descriptor type of the graph. 
 Default: <tt>dummy_property_map</tt> 
@@ -268,7 +268,7 @@
 vertex in the graph <tt>g</tt> is recorded in this property map. The
 shortest path weight is the sum of the edge weights along the
 shortest path. The type <tt>DistanceMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The vertex descriptor type of the graph needs to
 be usable as the key type of the distance map.

@@ -280,7 +280,7 @@
 StrictWeakOrdering</a> provided by the <tt>compare</tt> function
 object. 
 Default: <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the <tt>WeightMap</tt>'s value type of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -352,12 +352,12 @@
 from the queue. At the end of the algorithm, vertices reachable from
 the source vertex will have been colored black. All other vertices
 will still be white. The type <tt>ColorMap</tt> must be a model of
- <a href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ <a href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. A vertex descriptor must be usable as the key type
 of the map, and the value type of the map must be a model of
 <a href="./ColorValue.html">Color Value</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a <tt>std::vector</tt>
 of <tt>default_color_type</tt> of size <tt>num_vertices(g)</tt> and
 using the <tt>i_map</tt> for the index map.

Modified: trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html
==============================================================================
--- trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html (original)
+++ trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -193,7 +193,7 @@
 <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
 exception is one of the edges is negative.
 The type <tt>WeightMap</tt> must be a model of
- Readable Property Map. The edge descriptor type of
+ Readable Property Map. The edge descriptor type of
 the graph needs to be usable as the key type for the weight
 map. The value type for this map must be
 the same as the value type of the distance map. 
@@ -208,7 +208,7 @@
 HREF="bibliography.html#driscoll88">61</A>] when an edge is relaxed.
 The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, graph)</tt>.
@@ -227,7 +227,7 @@
 u then u is either the source vertex or a vertex that is
 not reachable from the source. The <tt>PredecessorMap</tt> type
 must be a <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> whose key and value types are the same as the vertex
 descriptor type of the graph. 
 Default: <tt>dummy_property_map</tt> 
@@ -241,7 +241,7 @@
 vertex in the graph <tt>graph</tt> is recorded in this property map. The
 shortest path weight is the sum of the edge weights along the
 shortest path. The type <tt>DistanceMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The vertex descriptor type of the graph needs to
 be usable as the key type of the distance map.

@@ -253,7 +253,7 @@
 StrictWeakOrdering</a> provided by the <tt>distance_compare</tt> function
 object. 
 Default: <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the <tt>WeightMap</tt>'s value type of size
 <tt>num_vertices(graph)</tt> and using the <tt>index_map</tt> for the index

Modified: trunk/libs/graph/doc/distance_recorder.html
==============================================================================
--- trunk/libs/graph/doc/distance_recorder.html (original)
+++ trunk/libs/graph/doc/distance_recorder.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -64,7 +64,7 @@
<TR><TD><TT>DistanceMap</TT></TD>
<TD>
A <a
-href="../../property_map/WritablePropertyMap.html">WritablePropertyMap</a>,
+href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap</a>,
where the key type and the value type are the vertex descriptor type
of the graph.
</TD>

Modified: trunk/libs/graph/doc/edmonds_karp_max_flow.html
==============================================================================
--- trunk/libs/graph/doc/edmonds_karp_max_flow.html (original)
+++ trunk/libs/graph/doc/edmonds_karp_max_flow.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -125,7 +125,7 @@
<blockquote>
 The edge capacity property map. The type must be a model of a
 constant <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property Map</a>. The
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a>. The
 key type of the map must be the graph's edge descriptor type. 
 Default: <tt>get(edge_capacity, g)</tt>
</blockquote>
@@ -134,7 +134,7 @@
<blockquote>
 This maps edges to their residual capacity. The type must be a model
 of a mutable <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
 Map</a>. The key type of the map must be the graph's edge descriptor
 type. 
 Default: <tt>get(edge_residual_capacity, g)</tt>
@@ -144,7 +144,7 @@
<blockquote>
 An edge property map that maps every edge (u,v) in the graph
 to the reverse edge (v,u). The map must be a model of
- constant <a href="../../property_map/LvaluePropertyMap.html">Lvalue
+ constant <a href="../../property_map/doc/LvaluePropertyMap.html">Lvalue
 Property Map</a>. The key type of the map must be the graph's edge
 descriptor type. 
 Default: <tt>get(edge_reverse, g)</tt>
@@ -156,13 +156,13 @@
 breadth-first search stage. At the end of the algorithm, the white
 vertices define the minimum cut set. The map must be a model of
 mutable <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property Map</a>.
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a>.
 The key type of the map should be the graph's vertex descriptor type, and
 the value type must be a model of <a
 href="./ColorValue.html">ColorValue</a>. 

 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a <tt>std::vector</tt>
 of <tt>default_color_type</tt> of size <tt>num_vertices(g)</tt> and
 using the <tt>i_map</tt> for the index map.
@@ -172,12 +172,12 @@
<blockquote>
 Use by the algorithm to store augmenting paths. The map must be a
 model of mutable <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property Map</a>.
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a>.
 The key type must be the graph's vertex descriptor type and the
 value type must be the graph's edge descriptor type. 

 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a <tt>std::vector</tt>
 of edge descriptors of size <tt>num_vertices(g)</tt> and
 using the <tt>i_map</tt> for the index map.
@@ -189,7 +189,7 @@
 <tt>[0, num_vertices(g))</tt>. This property map is only needed
 if the default for the color or predecessor map is used.
 The vertex index map must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The key type of the map must be the graph's vertex
 descriptor type. 
 Default: <tt>get(vertex_index, g)</tt>

Modified: trunk/libs/graph/doc/floyd_warshall_shortest.html
==============================================================================
--- trunk/libs/graph/doc/floyd_warshall_shortest.html (original)
+++ trunk/libs/graph/doc/floyd_warshall_shortest.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -101,7 +101,7 @@
IN: <code>weight_map(WeightMap w)</code>
<blockquote>
The weight of length of each edge in the graph. The <code>WeightMap</code>
-must be a model of <a href="../../property_map/ReadablePropertyMap.html">Readable Property
+must be a model of <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
Map</a>. The edge descriptor
type of the graph needs to be usable as the key type for the weight
map. The <code>value_type</code> of the weight map must be the type of the

Modified: trunk/libs/graph/doc/fruchterman_reingold.html
==============================================================================
--- trunk/libs/graph/doc/fruchterman_reingold.html (original)
+++ trunk/libs/graph/doc/fruchterman_reingold.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -96,7 +96,7 @@
 typically be initialized with the vertices at random locations (use
 <a href="random_layout.html"><tt>random_graph_layout</tt></a>). The
 type <tt>PositionMap</tt> must be a model of <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
 Map</a> such that the vertex descriptor type of <tt>Graph</tt> is
 convertible to its key type. Its value type must be a structure
 with fields <tt>x</tt> and <tt>y</tt>, representing the coordinates
@@ -197,7 +197,7 @@
 num_vertices(g))</tt>. This is only necessary when no
 displacement map is provided.
 The type <tt>VertexIndexMap</tt> must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/gursoy_atun_layout.html
==============================================================================
--- trunk/libs/graph/doc/gursoy_atun_layout.html (original)
+++ trunk/libs/graph/doc/gursoy_atun_layout.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -126,7 +126,7 @@
<blockquote>
 The property map that stores the position of each vertex. The type
 <tt>PositionMap</tt> must be a model of <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
 Map</a> such that the vertex descriptor type of <tt>Graph</tt> is
 convertible to its key type. Its value type must be the type of a
 point in the topology.
@@ -180,7 +180,7 @@
 This maps each vertex to an integer in the range <tt>[0,
 num_vertices(g))</tt>.
 The type <tt>VertexIndexMap</tt> must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map. 
@@ -197,7 +197,7 @@
 num_vertices(g))</tt>. This is only necessary when no
 displacement map is provided.
 The type <tt>EdgeWeightMap</tt> must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an floating-point type
 compatible with <tt>double</tt>. The edge descriptor type of the
 graph needs to be usable as the key type of the map. When this map

Modified: trunk/libs/graph/doc/howard_cycle_ratio.html
==============================================================================
--- trunk/libs/graph/doc/howard_cycle_ratio.html (original)
+++ trunk/libs/graph/doc/howard_cycle_ratio.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -147,7 +147,7 @@
boost::graph_traits<TGraph>::edge_descriptor>* pcc
<BLOCKQUOTE>An edge descriptors of one critical cycle will be stored in the corresponding std::vector. Default value is 0.</BLOCKQUOTE>
<BLOCKQUOTE STYLE="margin-left: 0cm">
-The all maps must be a models of <A HREF="../..//property_map/ReadablePropertyMap.html">Readable
+The all maps must be a models of <A HREF="../..//property_map/doc/ReadablePropertyMap.html">Readable
Property Map</A></BLOCKQUOTE>
<H3>Complexity</H3>
There is no known precise upper bound for the time complexity of the

Modified: trunk/libs/graph/doc/is_kuratowski_subgraph.html
==============================================================================
--- trunk/libs/graph/doc/is_kuratowski_subgraph.html (original)
+++ trunk/libs/graph/doc/is_kuratowski_subgraph.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -98,7 +98,7 @@
IN: <tt>VertexIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps vertices from <tt>g</tt> to distinct integers in the range
<tt>[0, num_vertices(g) )</tt> 
Default: <tt>get(vertex_index,g)</tt>

Modified: trunk/libs/graph/doc/is_straight_line_drawing.html
==============================================================================
--- trunk/libs/graph/doc/is_straight_line_drawing.html (original)
+++ trunk/libs/graph/doc/is_straight_line_drawing.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -56,7 +56,7 @@
IN: <tt>PositionMap</tt>

<blockquote>
-A <a href="../../property_map/LvaluePropertyMap.html">Readable LValue Property
+A <a href="../../property_map/doc/LvaluePropertyMap.html">Readable LValue Property
Map</a> that models the Position Map concept. The Position Map concept requires
that the value mapped to be an object that has members <tt>x</tt> and
<tt>y</tt>. For example, if <tt>p</tt> models PositionMap and <tt>v</tt>
@@ -68,7 +68,7 @@
IN: <tt>VertexIndexMap vm</tt>

<blockquote>
-A Readable Property Map that maps vertices from <tt>g</tt> to distinct integers in the range <tt>[0, num_vertices(g) )</tt> 
+A Readable Property Map that maps vertices from <tt>g</tt> to distinct integers in the range <tt>[0, num_vertices(g) )</tt> 
Default: <tt>get(vertex_index,g)</tt> 
</blockquote>

Modified: trunk/libs/graph/doc/isomorphism.html
==============================================================================
--- trunk/libs/graph/doc/isomorphism.html (original)
+++ trunk/libs/graph/doc/isomorphism.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -93,9 +93,9 @@
OUT: <tt>isomorphism_map(IsoMap f)</tt>
<blockquote>
The mapping from vertices in graph 1 to vertices in graph 2. This must
-be a <a href="../../property_map/ReadWritePropertyMap.html">Read/Write
+be a <a href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
Property Map</a>. Default: an <a
-href="../../property_map/iterator_property_map.html"><tt>iterator_property_map</tt></a>
+href="../../property_map/doc/iterator_property_map.html"><tt>iterator_property_map</tt></a>
constructed from a <tt>std::vector</tt> of graph 2's vertex
descriptor type and the vertex index map for graph 1. 
Python: Must be a <tt>vertex_vertex_map</tt> for the first graph.
@@ -147,7 +147,7 @@
num_vertices(g))</tt>. This is necessary for efficient updates of the
heap data structure when an edge is relaxed. The type
<tt>VertexIndex1Map</tt> must be a model of <a
-href="../../property_map/ReadablePropertyMap.html">Readable Property
+href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
Map</a>. The value type of the map must be an integer type. The vertex
descriptor type of graph 1 needs to be usable as the key type of the
map. 
@@ -166,7 +166,7 @@
num_vertices(g))</tt>. This is necessary for efficient updates of the
heap data structure when an edge is relaxed. The type
<tt>VertexIndex2Map</tt> must be a model of <a
-href="../../property_map/ReadablePropertyMap.html">Readable Property
+href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
Map</a>. The value type of the map must be an integer type. The vertex
descriptor type of graph 2 needs to be usable as the key type of the
map.

Modified: trunk/libs/graph/doc/johnson_all_pairs_shortest.html
==============================================================================
--- trunk/libs/graph/doc/johnson_all_pairs_shortest.html (original)
+++ trunk/libs/graph/doc/johnson_all_pairs_shortest.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -88,7 +88,7 @@
<blockquote>
 The weight or ``length'' of each edge in the graph.
 The type <tt>WeightMap</tt> must be a model of
- Readable Property Map. The edge descriptor type of
+ Readable Property Map. The edge descriptor type of
 the graph needs to be usable as the key type for the weight
 map. The value type for the map must be
 Addable with the value type of the distance map. 
@@ -106,7 +106,7 @@
 num_vertices(g))</tt>. This is necessary for efficient updates of the
 heap data structure in the internal call to Dijkstra's algorithm. The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, g)</tt>
@@ -172,12 +172,12 @@
 from the queue. At the end of the algorithm, vertices reachable from
 the source vertex will have been colored black. All other vertices
 will still be white. The type <tt>ColorMap</tt> must be a model of
- <a href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ <a href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. A vertex descriptor must be usable as the key type
 of the map, and the value type of the map must be a model of
 <a href="./ColorValue.html">Color Value</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a <tt>std::vector</tt>
 of <tt>default_color_type</tt> of size <tt>num_vertices(g)</tt> and
 using the <tt>i_map</tt> for the index map.

Modified: trunk/libs/graph/doc/kamada_kawai_spring_layout.html
==============================================================================
--- trunk/libs/graph/doc/kamada_kawai_spring_layout.html (original)
+++ trunk/libs/graph/doc/kamada_kawai_spring_layout.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -157,7 +157,7 @@
<blockquote>
 This property map is used to store the position of each vertex. The
 type <tt>PositionMap</tt> must be a model of <a
- href="../../property_map/WritablePropertyMap.html">Writable Property
+ href="../../property_map/doc/WritablePropertyMap.html">Writable Property
 Map</a>, with the graph's vertex descriptor type as its key type. 

 Python: The position map must be a <tt>vertex_point2d_map</tt> for
@@ -172,7 +172,7 @@
 <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
 exception is one of the edges is negative.
 The type <tt>WeightMap</tt> must be a model of
- Readable Property Map. The edge descriptor type of
+ Readable Property Map. The edge descriptor type of
 the graph needs to be usable as the key type for the weight
 map. The value type for this map must be
 the same as the value type of the distance map. 
@@ -260,7 +260,7 @@
A property map that will be used to store the partial derivates of
each vertex with respect to the <tt class="computeroutput">x</tt> and
<tt class="computeroutput">y</tt> coordinates. This must be a
-<a href="../../property_map/ReadWritePropertyMap.html">Read/Write
+<a href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
Property Map</a> whose value type is a pair with both types equivalent
to the value type of the weight map. The default is an iterator
property map.

Modified: trunk/libs/graph/doc/kevin_bacon.html
==============================================================================
--- trunk/libs/graph/doc/kevin_bacon.html (original)
+++ trunk/libs/graph/doc/kevin_bacon.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -281,7 +281,7 @@
but not with other variations of <TT>adjacency_list</TT>. A more
generic way to index based on vertices is to use the ID property
map (<TT>vertex_index_t</TT>) in coordination with the <A
-HREF="../../property_map/iterator_property_map.html"><TT>iterator_property_map</TT></a>.
+HREF="../../property_map/doc/iterator_property_map.html"><TT>iterator_property_map</TT></a>.


Here are some excepts from the output of the program.

Modified: trunk/libs/graph/doc/kolmogorov_max_flow.html
==============================================================================
--- trunk/libs/graph/doc/kolmogorov_max_flow.html (original)
+++ trunk/libs/graph/doc/kolmogorov_max_flow.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -230,14 +230,14 @@
IN: <TT>edge_capacity(EdgeCapacityMap cap)</TT>

<BLOCKQUOTE>The edge capacity property map. The type must be a model
-of a constant <A HREF="../../property_map/LvaluePropertyMap.html">Lvalue
+of a constant <A HREF="../../property_map/doc/LvaluePropertyMap.html">Lvalue
Property Map</A>. The key type of the map must be the graph's edge
descriptor type. Default: <TT>get(edge_capacity, g)</TT>
</BLOCKQUOTE>
OUT: <TT>edge_residual_capacity(ResidualCapacityEdgeMap res)</TT>

<BLOCKQUOTE>The edge residual capacity property map. The type must be
-a model of a mutable <A HREF="../../property_map/LvaluePropertyMap.html">Lvalue
+a model of a mutable <A HREF="../../property_map/doc/LvaluePropertyMap.html">Lvalue
Property Map</A>. The key type of the map must be the graph's edge
descriptor type. Default: <TT>get(edge_residual_capacity,
g)</TT>
@@ -246,14 +246,14 @@

<BLOCKQUOTE>An edge property map that maps every edge (u,v) in
the graph to the reverse edge (v,u). The map must be a model
-of constant <A HREF="../../property_map/LvaluePropertyMap.html">Lvalue
+of constant <A HREF="../../property_map/doc/LvaluePropertyMap.html">Lvalue
Property Map</A>. The key type of the map must be the graph's edge
descriptor type. Default: <TT>get(edge_reverse, g)</TT>
</BLOCKQUOTE>
UTIL: <TT>vertex_predecessor(PredecessorMap pre_map)</TT>

<BLOCKQUOTE>A vertex property map that stores the edge to the vertex'
-predecessor. The map must be a model of mutable <A HREF="../../property_map/LvaluePropertyMap.html">Lvalue
+predecessor. The map must be a model of mutable <A HREF="../../property_map/doc/LvaluePropertyMap.html">Lvalue
Property Map</A>. The key type of the map must be the graph's vertex
descriptor type. Default: <TT>get(vertex_predecessor, g)</TT>
</BLOCKQUOTE>
@@ -263,7 +263,7 @@
vertex. If the color of a vertex after running the algorithm is black
the vertex belongs to the source tree else it belongs to the
sink-tree (used for minimum cuts). The map must be a model of mutable
-<A HREF="../../property_map/LvaluePropertyMap.html">Lvalue Property
+<A HREF="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
Map</A>. The key type of the map must be the graph's vertex
descriptor type. Default: <TT>get(vertex_color, g)</TT>
</BLOCKQUOTE>
@@ -271,7 +271,7 @@

<BLOCKQUOTE>A vertex property map that stores the distance to the
corresponding terminal. It's a utility-map for speeding up the
-algorithm. The map must be a model of mutable <A HREF="../../property_map/LvaluePropertyMap.html">Lvalue
+algorithm. The map must be a model of mutable <A HREF="../../property_map/doc/LvaluePropertyMap.html">Lvalue
Property Map</A>. The key type of the map must be the graph's vertex
descriptor type. Default: <TT>get(vertex_distance, g)</TT>
</BLOCKQUOTE>
@@ -279,7 +279,7 @@

<BLOCKQUOTE>Maps each vertex of the graph to a unique integer in the
range <TT>[0, num_vertices(g))</TT>. The map must be a model of
-constant LvaluePropertyMap.
+constant LvaluePropertyMap.
The key type of the map must be the graph's vertex descriptor
type. Default: <TT>get(vertex_index, g)</TT>
</BLOCKQUOTE>

Modified: trunk/libs/graph/doc/kruskal_min_spanning_tree.html
==============================================================================
--- trunk/libs/graph/doc/kruskal_min_spanning_tree.html (original)
+++ trunk/libs/graph/doc/kruskal_min_spanning_tree.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -106,7 +106,7 @@
<blockquote>
The weight or ``length'' of
 each edge in the graph. The <tt>WeightMap</tt> type must be a model
- of <a href="../../property_map/ReadablePropertyMap.html">Readable
+ of <a href="../../property_map/doc/ReadablePropertyMap.html">Readable
 Property Map</a> and its value type must be <a
 href="http://www.sgi.com/tech/stl/LessThanComparable.html">Less Than
 Comparable</a>. The key type of this map needs to be the graph's
@@ -120,12 +120,12 @@
<blockquote>
 This is used by the disjoint sets data structure.
 The type <tt>RankMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The vertex descriptor type of the graph needs to
 be usable as the key type of the rank map. The value type of the
 rank map must be an integer type. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the integers of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -140,11 +140,11 @@
 used for storing predecessors in the spanning tree. The predecessors
 of the spanning tree can be obtained from the spanning tree edges
 output. The type <tt>PredecessorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The key type value types of the predecessor map
 must be the vertex descriptor type of the graph. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of vertex descriptors of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -159,7 +159,7 @@
 num_vertices(g))</tt>. This is only necessary if the default is used
 for the rank or predecessor maps. The type <tt>VertexIndexMap</tt>
 must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/lengauer_tarjan_dominator.htm
==============================================================================
--- trunk/libs/graph/doc/lengauer_tarjan_dominator.htm (original)
+++ trunk/libs/graph/doc/lengauer_tarjan_dominator.htm 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -133,19 +133,19 @@
 This maps each vertex to an integer in the range <tt>[0, num_vertices(g))</tt>.
 The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map.
</blockquote>

IN/OUT: <tt>TimeMap dfnumMap</tt>
<blockquote>
- The sequence number of depth first search. The type <tt>TimeMap</tt> must be a model of Read/Write Property Map. The vertex descriptor type of the graph needs to be usable as the key type of the <tt>TimeMap</tt>.
+ The sequence number of depth first search. The type <tt>TimeMap</tt> must be a model of Read/Write Property Map. The vertex descriptor type of the graph needs to be usable as the key type of the <tt>TimeMap</tt>.
</blockquote>

IN/OUT: <tt>PredMap parentMap</tt>
<blockquote>
- The predecessor map records the parent of the depth first search tree. The <tt>PredMap</tt> type must be a Read/Write Property Map whose key and value types are the same as the vertex descriptor type of the graph.
+ The predecessor map records the parent of the depth first search tree. The <tt>PredMap</tt> type must be a Read/Write Property Map whose key and value types are the same as the vertex descriptor type of the graph.
</blockquote>

IN/OUT: <tt>VertexVector verticesByDFNum</tt>

Modified: trunk/libs/graph/doc/make_biconnected_planar.html
==============================================================================
--- trunk/libs/graph/doc/make_biconnected_planar.html (original)
+++ trunk/libs/graph/doc/make_biconnected_planar.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -77,7 +77,7 @@
IN: <tt>EdgeIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps edges from <tt>g</tt> to distinct integers in the range
<tt>[0, num_edges(g) )</tt> 
Default: <tt>get(edge_index,g)</tt>

Modified: trunk/libs/graph/doc/make_connected.html
==============================================================================
--- trunk/libs/graph/doc/make_connected.html (original)
+++ trunk/libs/graph/doc/make_connected.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -74,7 +74,7 @@
IN: <tt>VertexIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps vertices from <tt>g</tt> to distinct integers in the range
<tt>[0, num_vertices(g) )</tt> 
Default: <tt>get(vertex_index,g)</tt>

Modified: trunk/libs/graph/doc/make_maximal_planar.html
==============================================================================
--- trunk/libs/graph/doc/make_maximal_planar.html (original)
+++ trunk/libs/graph/doc/make_maximal_planar.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -72,7 +72,7 @@
IN: <tt>PlanarEmbedding embedding</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that models the PlanarEmbedding
concept.
</blockquote>
@@ -80,7 +80,7 @@
IN: <tt>VertexIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps vertices from <tt>g</tt> to distinct integers in the range
<tt>[0, num_vertices(g) )</tt> 
Default: <tt>get(vertex_index,g)</tt> 
@@ -89,7 +89,7 @@
IN: <tt>EdgeIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps edges from <tt>g</tt> to distinct integers in the range
<tt>[0, num_edges(g) )</tt> 
Default: <tt>get(edge_index,g)</tt>

Modified: trunk/libs/graph/doc/maximum_matching.html
==============================================================================
--- trunk/libs/graph/doc/maximum_matching.html (original)
+++ trunk/libs/graph/doc/maximum_matching.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -50,7 +50,7 @@
<tt>checked_edmonds_maximum_cardinality_matching</tt> find the
maximum cardinality matching in any undirected graph. The matching is returned in a
<tt>MateMap</tt>, which is a
-ReadWritePropertyMap
+ReadWritePropertyMap
that maps vertices to vertices. In the mapping returned, each vertex is either mapped
to the vertex it's matched to, or to <tt>graph_traits<Graph>::null_vertex()</tt> if it
doesn't participate in the matching. If no <tt>VertexIndexMap</tt> is provided, both functions
@@ -238,12 +238,12 @@

IN: <tt>VertexIndexMap vm</tt>
<blockquote>
-Must be a model of ReadablePropertyMap, mapping vertices to integer indices.
+Must be a model of ReadablePropertyMap, mapping vertices to integer indices.
</blockquote>

OUT: <tt>MateMap mate</tt>
<blockquote>
-Must be a model of ReadWritePropertyMap, mapping
+Must be a model of ReadWritePropertyMap, mapping
vertices to vertices. For any vertex v in the graph, <tt>get(mate,v)</tt> will be the vertex that v is matched to, or
<tt>graph_traits<Graph>::null_vertex()</tt> if v isn't matched.
</blockquote>

Modified: trunk/libs/graph/doc/metric_tsp_approx.html
==============================================================================
--- trunk/libs/graph/doc/metric_tsp_approx.html (original)
+++ trunk/libs/graph/doc/metric_tsp_approx.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -125,7 +125,7 @@
<blockquote>
 The weight of each edge in the graph.
 The type <tt>WeightMap</tt> must be a model of
- Readable Property Map. The edge descriptor type of
+ Readable Property Map. The edge descriptor type of
 the graph needs to be usable as the key type for the weight
 map. 
 Default: <tt>get(edge_weight, g)</tt> 
@@ -137,7 +137,7 @@
 num_vertices(g))</tt>. This is necessary for efficient updates of the
 heap data structure when an edge is relaxed. The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, g)</tt>

Modified: trunk/libs/graph/doc/minimum_degree_ordering.html
==============================================================================
--- trunk/libs/graph/doc/minimum_degree_ordering.html (original)
+++ trunk/libs/graph/doc/minimum_degree_ordering.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -92,7 +92,7 @@

<li> <tt>OutDegreeMap outdegree</tt> &nbsp(WORK) 
 This is used internally to store the out degree of vertices. This
- must be a <a href="../../property_map/LvaluePropertyMap.html">
+ must be a <a href="../../property_map/doc/LvaluePropertyMap.html">
 LvaluePropertyMap</a> with key type the same as the vertex
 descriptor type of the graph, and with a value type that is an
 integer type.
@@ -100,19 +100,19 @@
<li> <tt>InversePermutationMap inverse_perm</tt> &nbsp(OUT) 
 The new vertex ordering, given as the mapping from the
 new indices to the old indices (an inverse permutation).
- This must be an <a href="../../property_map/LvaluePropertyMap.html">
+ This must be an <a href="../../property_map/doc/LvaluePropertyMap.html">
 LvaluePropertyMap</a> with a value type and key type a signed integer.

<li> <tt>PermutationMap perm</tt> &nbsp(OUT) 
 The new vertex ordering, given as the mapping from the
 old indices to the new indices (a permutation).
- This must be an <a href="../../property_map/LvaluePropertyMap.html">
+ This must be an <a href="../../property_map/doc/LvaluePropertyMap.html">
 LvaluePropertyMap</a> with a value type and key type a signed integer.

<li> <tt>SuperNodeSizeMap supernode_size</tt> &nbsp(WORK/OUT) 
 This is used internally to record the size of supernodes and is also
 useful information to have. This is a <a
- href="../../property_map/LvaluePropertyMap.html">
+ href="../../property_map/doc/LvaluePropertyMap.html">
 LvaluePropertyMap</a> with an unsigned integer value type and key
 type of vertex descriptor.

@@ -124,7 +124,7 @@

<li> <tt>VertexIndexMap id</tt> &nbsp(IN) 
 Used internally to map vertices to their indices. This must be a <a
- href="../../property_map/ReadablePropertyMap.html"> Readable
+ href="../../property_map/doc/ReadablePropertyMap.html"> Readable
 Property Map</a> with key type the same as the vertex descriptor of
 the graph and a value type that is some unsigned integer type.

Modified: trunk/libs/graph/doc/planar_canonical_ordering.html
==============================================================================
--- trunk/libs/graph/doc/planar_canonical_ordering.html (original)
+++ trunk/libs/graph/doc/planar_canonical_ordering.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -101,7 +101,7 @@
IN: <tt>VertexIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps vertices from <tt>g</tt> to distinct integers in the range
<tt>[0, num_vertices(g) )</tt> 
Default: <tt>get(vertex_index,g)</tt>

Modified: trunk/libs/graph/doc/planar_face_traversal.html
==============================================================================
--- trunk/libs/graph/doc/planar_face_traversal.html (original)
+++ trunk/libs/graph/doc/planar_face_traversal.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -173,7 +173,7 @@
IN: <tt>EdgeIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps edges from <tt>g</tt> to distinct integers in the range
<tt>[0, num_edges(g) )</tt> 
Default: <tt>get(edge_index,g)</tt>

Modified: trunk/libs/graph/doc/planar_graphs.html
==============================================================================
--- trunk/libs/graph/doc/planar_graphs.html (original)
+++ trunk/libs/graph/doc/planar_graphs.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -119,7 +119,7 @@
models PlanarEmbedding can be passed into the planarity test and populated if
the input graph is planar. All other "back end" planar graph algorithms accept
this populated PlanarEmbedding as an input. Conceptually, a type that models
-PlanarEmbedding is a <a href="../../property_map/property_map.html">property
+PlanarEmbedding is a <a href="../../property_map/doc/property_map.html">property
map</a> that maps each vertex to a sequence of edges,
where the sequence of edges has a similar interface to a standard C++
container. The sequence of edges each vertex maps to represents the ordering

Modified: trunk/libs/graph/doc/predecessor_recorder.html
==============================================================================
--- trunk/libs/graph/doc/predecessor_recorder.html (original)
+++ trunk/libs/graph/doc/predecessor_recorder.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -74,7 +74,7 @@
<TR><TD><TT>PredecessorMap</TT></TD>
<TD>
A <a
-href="../../property_map/WritablePropertyMap.html">WritablePropertyMap</a>,
+href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap</a>,
where the key type and the value type are the vertex descriptor type
of the graph.
</TD>

Modified: trunk/libs/graph/doc/prim_minimum_spanning_tree.html
==============================================================================
--- trunk/libs/graph/doc/prim_minimum_spanning_tree.html (original)
+++ trunk/libs/graph/doc/prim_minimum_spanning_tree.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -144,7 +144,7 @@
 tree. If p[u] = u then u is either the root of the
 tree or is a vertex that is not reachable from the root.
 The <tt>PredecessorMap</tt> type must be a <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>
 with key and vertex types the same as the vertex descriptor type
 of the graph. 
@@ -165,7 +165,7 @@
<blockquote>
 The weight or ``length'' of each edge in the graph.
 The type <tt>WeightMap</tt> must be a model of
- Readable Property Map. The edge descriptor type of
+ Readable Property Map. The edge descriptor type of
 the graph needs to be usable as the key type for the weight
 map. The value type for the map must be
 Addable with the value type of the distance map. 
@@ -180,7 +180,7 @@
 num_vertices(g))</tt>. This is necessary for efficient updates of the
 heap data structure when an edge is relaxed. The type
 <tt>VertexIndexMap</tt> must be a model of
- Readable Property Map. The value type of the map must be an
+ Readable Property Map. The value type of the map must be an
 integer type. The vertex descriptor type of the graph needs to be
 usable as the key type of the map. 
 Default: <tt>get(vertex_index, g)</tt>
@@ -199,13 +199,13 @@
 shortest path weight is the sum of the edge weights along the
 shortest path. The type <tt>DistanceMap</tt> must be a model of
 <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. The vertex descriptor type of the
 graph needs to be usable as the key type of the distance map. The
 value type of the distance map must be <a
 href="http://www.sgi.com/tech/stl/LessThanComparable.html">Less Than
 Comparable</a>. 
- Default: <a href="../../property_map/iterator_property_map.html">
+ Default: <a href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the <tt>WeightMap</tt>'s value type of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -222,12 +222,12 @@
 from the queue. At the end of the algorithm, vertices reachable from
 the source vertex will have been colored black. All other vertices
 will still be white. The type <tt>ColorMap</tt> must be a model of
- <a href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ <a href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a>. A vertex descriptor must be usable as the key type
 of the map, and the value type of the map must be a model of
 <a href="./ColorValue.html">Color Value</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a <tt>std::vector</tt>
 of <tt>default_color_type</tt> of size <tt>num_vertices(g)</tt> and
 using the <tt>i_map</tt> for the index map.

Modified: trunk/libs/graph/doc/property_map.html
==============================================================================
--- trunk/libs/graph/doc/property_map.html (original)
+++ trunk/libs/graph/doc/property_map.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -24,7 +24,7 @@
</H1>

This is the traits class that produces the type for a <a
-href="../../property_map/property_map.html">property map</a> object
+href="../../property_map/doc/property_map.html">property map</a> object
for a particular graph type. The property is specified by the <a
href="./PropertyTag.html">PropertyTag</a> template parameter. Graph classes
must specialize this traits class to provide their own implementation
@@ -53,7 +53,7 @@
The (mutable) property map type for mapping vertex or edge desriptors of
the graph to their associated property values, where the property is
specified by <tt>PropertyTag</tt>. This type is a <a
-href="../../property_map/property_map.html">property map</a>.
+href="../../property_map/doc/property_map.html">property map</a>.
</tr>

<tr>
@@ -63,7 +63,7 @@
The (non-mutable) property map type for mapping vertex or edge
desriptors of the graph to their associated property values, where the
property is specified by <tt>PropertyTag</tt>. This type is a <a
-href="../../property_map/property_map.html">property map</a>.
+href="../../property_map/doc/property_map.html">property map</a>.
</tr>

</table>

Modified: trunk/libs/graph/doc/property_writer.html
==============================================================================
--- trunk/libs/graph/doc/property_writer.html (original)
+++ trunk/libs/graph/doc/property_writer.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -74,7 +74,7 @@
<TR><TD><TT>PropertyMap</TT></TD>
<TD>
A <a
-href="../../property_map/ReadablePropertyMap.html">ReadablePropertyMap</a>,
+href="../../property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap</a>,
where the <tt>key_type</tt> is the vertex descriptor type or edge
descriptor of the graph (depending on the kind of event tag), and
the <tt>value_type</tt> of the property is convertible

Modified: trunk/libs/graph/doc/push_relabel_max_flow.html
==============================================================================
--- trunk/libs/graph/doc/push_relabel_max_flow.html (original)
+++ trunk/libs/graph/doc/push_relabel_max_flow.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -108,7 +108,7 @@
<blockquote>
 The edge capacity property map. The type must be a model of a
 constant <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property Map</a>. The
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a>. The
 key type of the map must be the graph's edge descriptor type. 
 Default: <tt>get(edge_capacity, g)</tt>
</blockquote>
@@ -117,7 +117,7 @@
<blockquote>
 The edge residual capacity property map. The type must be a model of
 a mutable <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property Map</a>. The
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a>. The
 key type of the map must be the graph's edge descriptor type. 
 Default: <tt>get(edge_residual_capacity, g)</tt>
</blockquote>
@@ -127,7 +127,7 @@
 An edge property map that maps every edge (u,v) in the graph
 to the reverse edge (v,u). The map must be a model of
 constant <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property Map</a>. The
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a>. The
 key type of the map must be the graph's edge descriptor type. 
 Default: <tt>get(edge_reverse, g)</tt>
</blockquote>
@@ -136,7 +136,7 @@
<blockquote>
 Maps each vertex of the graph to a unique integer in the range
 <tt>[0, num_vertices(g))</tt>. The map must be a model of constant <a
- href="../../property_map/LvaluePropertyMap.html">LvaluePropertyMap</a>. The
+ href="../../property_map/doc/LvaluePropertyMap.html">LvaluePropertyMap</a>. The
 key type of the map must be the graph's vertex descriptor type. 
 Default: <tt>get(vertex_index, g)</tt>
 Note: if you use this default, make sure your graph has

Modified: trunk/libs/graph/doc/quick_tour.html
==============================================================================
--- trunk/libs/graph/doc/quick_tour.html (original)
+++ trunk/libs/graph/doc/quick_tour.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -502,7 +502,7 @@
algorithm, the visitor we create must be a Dijkstra Visitor.
The functionality of the <tt>record_predecessors</tt> visitor is separated
into two parts. For the storage and access of the predecessor property, we will
-use a property map. The
+use a property map. The
predecessor visitor will then only be responsible for what parent to record. To
implement this, we create a <tt>record_predecessors</tt> class and template it
on the predecessor property map <tt>PredecessorMap</tt>. Since this visitor will

Modified: trunk/libs/graph/doc/r_c_shortest_paths.html
==============================================================================
--- trunk/libs/graph/doc/r_c_shortest_paths.html (original)
+++ trunk/libs/graph/doc/r_c_shortest_paths.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -420,11 +420,11 @@
</blockquote>
IN: <tt>const VertexIndexMap& vertex_index_map</tt>
<blockquote>
-A ReadablePropertyMap mapping vertex descriptors to integers in [0, <tt>num_vertices(g)</tt>).
+A ReadablePropertyMap mapping vertex descriptors to integers in [0, <tt>num_vertices(g)</tt>).
</blockquote>
IN: <tt>const EdgeIndexMap& edge_index_map</tt>
<blockquote>
-A ReadablePropertyMap mapping edge descriptors to integers in [0, <tt>num_edges(g)</tt>).
+A ReadablePropertyMap mapping edge descriptors to integers in [0, <tt>num_edges(g)</tt>).
</blockquote>
IN: <tt>typename graph_traits<Graph>::vertex_descriptor s</tt>
<blockquote>

Modified: trunk/libs/graph/doc/random_layout.html
==============================================================================
--- trunk/libs/graph/doc/random_layout.html (original)
+++ trunk/libs/graph/doc/random_layout.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -51,7 +51,7 @@
<blockquote>
 The property map that stores the position of each vertex. The type
 <tt>PositionMap</tt> must be a model of <a
- href="../../property_map/LvaluePropertyMap.html">Lvalue Property
+ href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
 Map</a> such that the vertex descriptor type of <tt>Graph</tt> is
 convertible to its key type. Its value type must be a structure with
 fields <tt>x</tt> and <tt>y</tt>, representing the coordinates of

Modified: trunk/libs/graph/doc/read_dimacs.html
==============================================================================
--- trunk/libs/graph/doc/read_dimacs.html (original)
+++ trunk/libs/graph/doc/read_dimacs.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -73,12 +73,12 @@

 OUT: <tt>CapacityMap capacity</tt>
<blockquote>
- A property map that models mutable Lvalue Property Map whose key type is the edge descriptor of the graph. 
+ A property map that models mutable Lvalue Property Map whose key type is the edge descriptor of the graph. 
</blockquote>

 OUT: <tt>ReverseEdgeMap reverse_edge</tt>
<blockquote>
- A property map that models mutable Lvalue Property Map whose key and value type is the edge descriptor of the graph. This map stores the corresponding reverse edge for each each in Graph g. 
+ A property map that models mutable Lvalue Property Map whose key and value type is the edge descriptor of the graph. This map stores the corresponding reverse edge for each each in Graph g. 
</blockquote>

 IN: <tt>std::istream& in</tt>

Modified: trunk/libs/graph/doc/sequential_vertex_coloring.html
==============================================================================
--- trunk/libs/graph/doc/sequential_vertex_coloring.html (original)
+++ trunk/libs/graph/doc/sequential_vertex_coloring.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -57,7 +57,7 @@
<blockquote>
 This property map records the colors of each vertex. It must be a
 model of
- <a href="../../property_map/WritablePropertyMap.html">Writeable
+ <a href="../../property_map/doc/WritablePropertyMap.html">Writeable
 Property Map</a> whose key type is the same as the vertex descriptor
 type of the graph and whose value type is an integral type that can
 store all values of the graph's <tt>vertices_size_type</tt>.

Modified: trunk/libs/graph/doc/stanford_graph.html
==============================================================================
--- trunk/libs/graph/doc/stanford_graph.html (original)
+++ trunk/libs/graph/doc/stanford_graph.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -384,7 +384,7 @@
The SGB <tt>Vertex</tt> and <tt>Arc</tt> structures provide
"utility" fields for storing extra information. We provide
BGL wrappers that provide access to these fields through <a
-href="../../property_map/property_map.html">property maps</a>. In
+href="../../property_map/doc/property_map.html">property maps</a>. In
addition, vertex index and edge length maps are provided. A property
map object can be obtained from a SGB <tt>Graph*</tt> using the
<tt>get()</tt> function described in the <a
@@ -415,17 +415,17 @@
<tt>gb_graph.h</tt>, which are <tt>Vertex*</tt>, <tt>Arc*</tt>,
<tt>Graph*</tt>, <tt>char*</tt>, and <tt>long</tt>. The property maps
for the utility fields are models of <a
-href="../../property_map/LvaluePropertyMap.html">Lvalue Property
+href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
Map</a>.



The property map for vertex indices can be obtained using the
<tt>vertex_index_t</tt> tag, and this property map is a <a
-href="../../property_map/ReadablePropertyMap.html">Readable Property
+href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
Map</a>. A property map for edge length's can be obtained using the
<tt>edge_length_t</tt> tag, and this property map is a <a
-href="../../property_map/LvaluePropertyMap.html">Lvalue Property
+href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
Map</a> whose value type is <tt>long</tt>.

Modified: trunk/libs/graph/doc/straight_line_drawing.html
==============================================================================
--- trunk/libs/graph/doc/straight_line_drawing.html (original)
+++ trunk/libs/graph/doc/straight_line_drawing.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -95,7 +95,7 @@
IN <tt>PlanarEmbedding embedding</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that models the PlanarEmbedding
concept.
</blockquote>
@@ -110,7 +110,7 @@
OUT: <tt>PositionMap</tt>

<blockquote>
-A <a href="../../property_map/LvaluePropertyMap.html">Writable LValue Property
+A <a href="../../property_map/doc/LvaluePropertyMap.html">Writable LValue Property
Map</a> that models the Position Map concept. The Position Map concept requires
that the value mapped to be an object that has members <tt>x</tt> and
<tt>y</tt>. For example, if <tt>p</tt> models PositionMap and <tt>v</tt>
@@ -122,7 +122,7 @@
IN: <tt>VertexIndexMap vm</tt>

<blockquote>
-A <a href="../../property_map/ReadablePropertyMap.html">Readable Property Map
+A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
</a> that maps vertices from <tt>g</tt> to distinct integers in the range
<tt>[0, num_vertices(g) )</tt> 
Default: <tt>get(vertex_index,g)</tt>

Modified: trunk/libs/graph/doc/strong_components.html
==============================================================================
--- trunk/libs/graph/doc/strong_components.html (original)
+++ trunk/libs/graph/doc/strong_components.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -83,7 +83,7 @@
records which component each vertex in the graph belongs to by
recording the component number in the component property map. The
<tt>ComponentMap</tt> type must be a model of <a
-href="../../property_map/WritablePropertyMap.html">Writable Property
+href="../../property_map/doc/WritablePropertyMap.html">Writable Property
Map</a>. The value type shouch be an integer type, preferably the same
as the <tt>vertices_size_type</tt> of the graph. The key type must be
the graph's vertex descriptor type. 
@@ -102,12 +102,12 @@
 for each component and <tt>get(r_map, v)</tt> returns the root
 vertex for whichever component vertex <tt>v</tt> is a member.
 The <TT>RootMap</TT> must be a <a
- href="../../property_map/ReadWritePropertyMap.html">
+ href="../../property_map/doc/ReadWritePropertyMap.html">
 Read/Write Property Map</a>, where the key type and the value type are
 the vertex descriptor type of the graph. 

 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of vertex descriptors of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -119,11 +119,11 @@
<blockquote>
 This is used by the algorithm to keep track of the DFS ordering
 of the vertices. The <TT>TimeMap</TT> must be a model
- of <a href="../../property_map/ReadWritePropertyMap.html"> Read/Write
+ of <a href="../../property_map/doc/ReadWritePropertyMap.html"> Read/Write
 Property Map</a> and its value type must be an integer type. The key
 type must be the vertex descriptor type of the graph. 
 Default:an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of integers with size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -135,12 +135,12 @@
<blockquote>
 This is used by the algorithm to keep track of its progress through
 the graph. The type <tt>ColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's vertex
 descriptor type and the value type of the color map must model
 <a href="./ColorValue.html">ColorValue</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 <tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>default_color_type</tt> of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -154,7 +154,7 @@
 num_vertices(g))</tt>. This parameter is only necessary when a
 default is used for one of the other named parameters. The type
 <tt>VertexIndexMap</tt> must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/table_of_contents.html
==============================================================================
--- trunk/libs/graph/doc/table_of_contents.html (original)
+++ trunk/libs/graph/doc/table_of_contents.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -62,7 +62,7 @@
 <LI>Property Graph
 <LI>Mutable Property Graph
 </OL>
- <li>The Property Map Library (technically not part of the graph library, but used a lot here)
+ <li>The Property Map Library (technically not part of the graph library, but used a lot here)
 <li><img src="figs/python_ico.gif" alt="(Python)"/>Python bindings</li>
 <li>Visitor Concepts
 <OL>

Modified: trunk/libs/graph/doc/time_stamper.html
==============================================================================
--- trunk/libs/graph/doc/time_stamper.html (original)
+++ trunk/libs/graph/doc/time_stamper.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -74,7 +74,7 @@
<TR><TD><TT>TimeMap</TT></TD>
<TD>
A <a
-href="../../property_map/WritablePropertyMap.html">WritablePropertyMap</a>,
+href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap</a>,
where the <tt>key_type</tt> is the vertex descriptor type or edge
descriptor of the graph (depending on the kind of event tag), and
where the <tt>TimeT</tt> type is convertible to the

Modified: trunk/libs/graph/doc/topological_sort.html
==============================================================================
--- trunk/libs/graph/doc/topological_sort.html (original)
+++ trunk/libs/graph/doc/topological_sort.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -72,12 +72,12 @@
<blockquote>
 This is used by the algorithm to keep track of its progress through
 the graph. The type <tt>ColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's vertex
 descriptor type and the value type of the color map must model
 <a href="./ColorValue.html">ColorValue</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>default_color_type</tt> of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -93,7 +93,7 @@
 num_vertices(g))</tt>. This parameter is only necessary when the
 default color property map is used. The type <tt>VertexIndexMap</tt>
 must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/transitive_closure.html
==============================================================================
--- trunk/libs/graph/doc/transitive_closure.html (original)
+++ trunk/libs/graph/doc/transitive_closure.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -88,7 +88,7 @@
 num_vertices(g))</tt>. This parameter is only necessary when the
 default color property map is used. The type <tt>VertexIndexMap</tt>
 must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/transpose_graph.html
==============================================================================
--- trunk/libs/graph/doc/transpose_graph.html (original)
+++ trunk/libs/graph/doc/transpose_graph.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -84,7 +84,7 @@
IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
<blockquote>
The vertex index map type must be a model of <a
-href="../../property_map/ReadablePropertyMap.html">Readable Property
+href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
Map</a> and must map the vertex descriptors of <tt>G</tt> to the
integers from 0 to <tt>num_vertices(G)</tt>. 

@@ -101,7 +101,7 @@
This maps vertices in the original graph to vertices in the copy.

Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of the output graph's vertex descriptor type of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index

Modified: trunk/libs/graph/doc/tsp_tour_len_visitor.html
==============================================================================
--- trunk/libs/graph/doc/tsp_tour_len_visitor.html (original)
+++ trunk/libs/graph/doc/tsp_tour_len_visitor.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -57,7 +57,7 @@
<TD>
The weight of each edge in the graph.
The type <tt>WeightMap</tt> must be a model of
-Readable Property Map.
+Readable Property Map.
The edge descriptor type of the graph needs to be usable as the key type for the weight map.
</TD>
<TD>None</TD>

Modified: trunk/libs/graph/doc/undirected_dfs.html
==============================================================================
--- trunk/libs/graph/doc/undirected_dfs.html (original)
+++ trunk/libs/graph/doc/undirected_dfs.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -198,12 +198,12 @@
<blockquote>
 This is used by the algorithm to keep track of its progress through
 the graph. The type <tt>VertexColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's vertex
 descriptor type and the value type of the color map must model
 <a href="./ColorValue.html">ColorValue</a>. 
 Default: an <a
- href="../../property_map/iterator_property_map.html">
+ href="../../property_map/doc/iterator_property_map.html">
 </tt>iterator_property_map</tt></a> created from a
 <tt>std::vector</tt> of <tt>default_color_type</tt> of size
 <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
@@ -217,7 +217,7 @@
<blockquote>
 This is used by the algorithm to keep track of which edges
 have been visited. The type <tt>EdgeColorMap</tt> must be a model of <a
- href="../../property_map/ReadWritePropertyMap.html">Read/Write
+ href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
 Property Map</a> and its key type must be the graph's edge
 descriptor type and the value type of the color map must model
 <a href="./ColorValue.html">ColorValue</a>. 
@@ -242,7 +242,7 @@
 num_vertices(g))</tt>. This parameter is only necessary when the
 default color property map is used. The type <tt>VertexIndexMap</tt>
 must be a model of <a
- href="../../property_map/ReadablePropertyMap.html">Readable Property
+ href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
 Map</a>. The value type of the map must be an integer type. The
 vertex descriptor type of the graph needs to be usable as the key
 type of the map.

Modified: trunk/libs/graph/doc/using_property_maps.html
==============================================================================
--- trunk/libs/graph/doc/using_property_maps.html (original)
+++ trunk/libs/graph/doc/using_property_maps.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -29,7 +29,7 @@
graph algorithms should not have to deal with the implementation
details of the properties. The property map interface
defined in Section <A
-HREF="../../property_map/property_map.html">Property
+HREF="../../property_map/doc/property_map.html">Property
Map Concepts</A> provides a generic method for accessing
properties from graphs. This is the interface used in the BGL
algorithms to access properties.

Modified: trunk/libs/graph/doc/write-graphviz.html
==============================================================================
--- trunk/libs/graph/doc/write-graphviz.html (original)
+++ trunk/libs/graph/doc/write-graphviz.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -221,7 +221,7 @@

IN: <tt>VertexID vertex_id</tt>
<blockquote>
- A property map that models Readable Property Map whose key type is the vertex descriptor of the graph and whose value type can be written to a stream. The value should be a unique descriptor that can be used to name a node in a Graphviz file (so it should not, for instance, have any spaces in it). 
+ A property map that models Readable Property Map whose key type is the vertex descriptor of the graph and whose value type can be written to a stream. The value should be a unique descriptor that can be used to name a node in a Graphviz file (so it should not, for instance, have any spaces in it). 
Default: If no <code>dynamic_properties</code> object is provided, <tt>get(vertex_index, g)</tt>. Otherwise, a dynamic property map that accesses the property map named <code>node_id</code>.
</blockquote>
<H3>

Modified: trunk/libs/graph/doc/write_dimacs.html
==============================================================================
--- trunk/libs/graph/doc/write_dimacs.html (original)
+++ trunk/libs/graph/doc/write_dimacs.html 2009-05-30 21:32:55 EDT (Sat, 30 May 2009)
@@ -76,12 +76,12 @@

 IN: <tt>CapacityMap capacity</tt>
<blockquote>
- A property map that models Readable Property Map whose key type is the edge descriptor of the graph and whose value type can be written to a stream. 
+ A property map that models Readable Property Map whose key type is the edge descriptor of the graph and whose value type can be written to a stream. 
</blockquote>

 IN: <tt>IndexMap epw</tt>
<blockquote>
- A property map that models Readable Property Map whose key type is the vertex descriptor of the graph and whose value type can be written to a stream. 
+ A property map that models Readable Property Map whose key type is the vertex descriptor of the graph and whose value type can be written to a stream. 
</blockquote>

 OUT: <tt>std::ostream& out</tt>

Next message: jewillco_at_[hidden]: "[Boost-commit] svn:boost r53476 - in trunk/libs: . parameter/doc parameter/doc/html"
Previous message: jewillco_at_[hidden]: "[Boost-commit] svn:boost r53474 - in trunk/libs/property_map: . doc example"

Date view	Thread view	Subject view	Author view

Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk