[Boost-commit] svn:boost r52339 - in trunk/libs/graph_parallel/doc: . html

Subject: [Boost-commit] svn:boost r52339 - in trunk/libs/graph_parallel/doc: . html
From: jewillco_at_[hidden]
Date: 2009-04-11 13:37:52

Author: jewillco
Date: 2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
New Revision: 52339
URL: http://svn.boost.org/trac/boost/changeset/52339

Log:
Fixed (some) link problems found by inspect tool
Text files modified: 
   trunk/libs/graph_parallel/doc/boman_et_al_graph_coloring.rst       |     2 +-                                      
   trunk/libs/graph_parallel/doc/dijkstra_example.rst                 |     4 ++--                                    
   trunk/libs/graph_parallel/doc/html/boman_et_al_graph_coloring.html |     4 ++--                                    
   trunk/libs/graph_parallel/doc/html/dijkstra_example.html           |     6 +++---                                  
   trunk/libs/graph_parallel/doc/html/index.html                      |     3 ++-                                     
   trunk/libs/graph_parallel/doc/html/overview.html                   |    12 ++++++------                            
   trunk/libs/graph_parallel/doc/index.rst                            |     2 ++                                      
   trunk/libs/graph_parallel/doc/overview.rst                         |    12 ++++++------                            
   8 files changed, 24 insertions(+), 21 deletions(-)

Modified: trunk/libs/graph_parallel/doc/boman_et_al_graph_coloring.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/boman_et_al_graph_coloring.rst	(original)
+++ trunk/libs/graph_parallel/doc/boman_et_al_graph_coloring.rst	2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
@@ -51,7 +51,7 @@
 various problems, including register allocation in compilers,
 optimization problems, and scheduling problems.
 
-.. image:: vertex_coloring.png
+.. image:: ../vertex_coloring.png
   :width: 462
   :height: 269
   :alt: Vertex coloring example

Modified: trunk/libs/graph_parallel/doc/dijkstra_example.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/dijkstra_example.rst	(original)
+++ trunk/libs/graph_parallel/doc/dijkstra_example.rst	2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
@@ -11,7 +11,7 @@
 the shortest paths from vertex A to every other vertex in the
 following simple graph:
 
-.. image:: dijkstra_seq_graph.png
+.. image:: ../dijkstra_seq_graph.png
 
 With the sequential BGL_, the program to calculate shortest paths has
 three stages. Readers familiar with the BGL may wish to skip ahead to
@@ -133,7 +133,7 @@
 with that vertex or its edges. With three processors and the default
 block distribution, the graph would be distributed in this manner:
 
-.. image:: dijkstra_dist3_graph.png
+.. image:: ../dijkstra_dist3_graph.png
 
 Processor 0 (red) owns vertices A and B, including all edges outoing
 from those vertices, processor 1 (green) owns vertices C and D (and

Modified: trunk/libs/graph_parallel/doc/html/boman_et_al_graph_coloring.html
==============================================================================
--- trunk/libs/graph_parallel/doc/html/boman_et_al_graph_coloring.html	(original)
+++ trunk/libs/graph_parallel/doc/html/boman_et_al_graph_coloring.html	2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
@@ -57,7 +57,7 @@
 independent set in the graph. Graph coloring has been used to solve
 various problems, including register allocation in compilers,
 optimization problems, and scheduling problems.</p>
-<img align="right" alt="Vertex coloring example" class="align-right" src="vertex_coloring.png" style="width: 462px; height: 269px;" />
+<img align="right" alt="Vertex coloring example" class="align-right" src="../vertex_coloring.png" style="width: 462px; height: 269px;" />
 <p>The problem of coloring a graph with the fewest possible number of
 colors is NP-complete, so many algorithms (including the one
 implemented here) are heuristic algorithms that try to minimize the
@@ -176,7 +176,7 @@
 </div>
 <div class="footer">
 <hr class="footer" />
-Generated on: 2009-04-11 17:09 UTC.
+Generated on: 2009-04-11 17:23 UTC.
 Generated by <a class="reference external" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference external" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
 
 </div>

Modified: trunk/libs/graph_parallel/doc/html/dijkstra_example.html
==============================================================================
--- trunk/libs/graph_parallel/doc/html/dijkstra_example.html	(original)
+++ trunk/libs/graph_parallel/doc/html/dijkstra_example.html	2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
@@ -19,7 +19,7 @@
 illustrate the use of both the sequential and parallel BGL to find
 the shortest paths from vertex A to every other vertex in the
 following simple graph:</p>
-<img alt="dijkstra_seq_graph.png" src="dijkstra_seq_graph.png" />
+<img alt="../dijkstra_seq_graph.png" src="../dijkstra_seq_graph.png" />
 <p>With the sequential <a class="reference external" href="http://www.boost.org/libs/graph/doc">BGL</a>, the program to calculate shortest paths has
 three stages. Readers familiar with the BGL may wish to skip ahead to
 the section <a class="reference internal" href="#distributing-the-graph">Distributing the graph</a>.</p>
@@ -131,7 +131,7 @@
 the edges outgoing from that vertex and any properties associated
 with that vertex or its edges. With three processors and the default
 block distribution, the graph would be distributed in this manner:</p>
-<img alt="dijkstra_dist3_graph.png" src="dijkstra_dist3_graph.png" />
+<img alt="../dijkstra_dist3_graph.png" src="../dijkstra_dist3_graph.png" />
 <p>Processor 0 (red) owns vertices A and B, including all edges outoing
 from those vertices, processor 1 (green) owns vertices C and D (and
 their edges), and processor 2 (blue) owns vertex E. Constructing this
@@ -153,7 +153,7 @@
 </div>
 <div class="footer">
 <hr class="footer" />
-Generated on: 2009-04-11 17:09 UTC.
+Generated on: 2009-04-11 17:23 UTC.
 Generated by <a class="reference external" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference external" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
 
 </div>

Modified: trunk/libs/graph_parallel/doc/html/index.html
==============================================================================
--- trunk/libs/graph_parallel/doc/html/index.html	(original)
+++ trunk/libs/graph_parallel/doc/html/index.html	2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
@@ -87,6 +87,7 @@
 <li><a class="reference external" href="rmat_generator.html">R-MAT generator</a></li>
 <li><a class="reference external" href="sorted_rmat_generator.html">Sorted R-MAT generator</a></li>
 <li><a class="reference external" href="unique_rmat_generator.html">Unique R-MAT generator</a></li>
+<li><a class="reference external" href="sorted_unique_rmat_generator.html">Sorted unique R-MAT generator</a></li>
 <li><a class="reference external" href="scalable_rmat_generator.html">Scalable R-MAT generator</a></li>
 <li><a class="reference external" href="http://www.boost.org/libs/graph/doc/erdos_renyi_generator.html">Erdos-Renyi generator</a></li>
 <li><a class="reference external" href="http://www.boost.org/libs/graph/doc/sorted_erdos_renyi_gen.html">Sorted Erdos-Renyi generator</a></li>
@@ -137,7 +138,7 @@
 </div>
 <div class="footer">
 <hr class="footer" />
-Generated on: 2009-04-11 17:09 UTC.
+Generated on: 2009-04-11 17:23 UTC.
 Generated by <a class="reference external" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference external" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
 
 </div>

Modified: trunk/libs/graph_parallel/doc/html/overview.html
==============================================================================
--- trunk/libs/graph_parallel/doc/html/overview.html	(original)
+++ trunk/libs/graph_parallel/doc/html/overview.html	2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
@@ -15,7 +15,7 @@
 Use, modification and distribution is subject to the Boost Software
 License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
 http://www.boost.org/LICENSE_1_0.txt) -->
-<img align="right" alt="An example graph" class="align-right" src="graph.png" style="width: 206px; height: 184px;" />
+<img align="right" alt="An example graph" class="align-right" src="../graph.png" style="width: 206px; height: 184px;" />
 <p>The Parallel Boost Graph Library (Parallel BGL) is a C++ library for
 parallel, distributed computation on graphs. The Parallel BGL contains
 distributed graph data structures, distributed graph algorithms,
@@ -28,7 +28,7 @@
 way, e.g., &quot;X is the child of Y&quot;. The following figure illustrates a
 typical directed graph, where <em>a-i</em> are the vertices and the arrows
 represent edges.</p>
-<img align="right" alt="A distributed graph" class="align-right" src="distributed-graph.png" style="width: 229px; height: 199px;" />
+<img align="right" alt="A distributed graph" class="align-right" src="../distributed-graph.png" style="width: 229px; height: 199px;" />
 <p>The Parallel BGL is primarily concerned with <em>distributed</em>
 graphs. Distributed graphs are conceptually graphs, but their storage
 is spread across multiple processors. The following figure
@@ -59,8 +59,8 @@
 processors, and each of the edges outgoing from a vertex are stored on
 the processor that &quot;owns&quot; (stores) that vertex. The following figure
 illustrates the distributed adjacency list representation.</p>
-<div align="center" class="align-center"><img alt="A distributed adjacency list" class="align-center" src="dist-adjlist.png" style="width: 446px; height: 154px;" /></div>
-<img align="right" alt="A distributed property map" class="align-right" src="dist-pmap.png" style="width: 271px; height: 175px;" />
+<div align="center" class="align-center"><img alt="A distributed adjacency list" class="align-center" src="../dist-adjlist.png" style="width: 446px; height: 154px;" /></div>
+<img align="right" alt="A distributed property map" class="align-right" src="../dist-pmap.png" style="width: 271px; height: 175px;" />
 <p>The <a class="reference external" href="distributed_adjacency_list.html">distributed adjacency list</a> distributes the structure of a graph
 over multiple processors. While graph structure is in important part
 of many graph problems, there are typically other properties attached
@@ -102,7 +102,7 @@
 operating.</li>
 </ul>
 </blockquote>
-<div align="center" class="align-center"><img alt="Parallel Boost Graph Library architecture" class="align-center" src="architecture.png" style="width: 485px; height: 410px;" /></div>
+<div align="center" class="align-center"><img alt="Parallel Boost Graph Library architecture" class="align-center" src="../architecture.png" style="width: 485px; height: 410px;" /></div>
 <hr class="docutils" />
 <p>Copyright (C) 2005 The Trustees of Indiana University.</p>
 <p>Authors: Douglas Gregor and Andrew Lumsdaine</p>
@@ -110,7 +110,7 @@
 </div>
 <div class="footer">
 <hr class="footer" />
-Generated on: 2009-04-11 17:09 UTC.
+Generated on: 2009-04-11 17:23 UTC.
 Generated by <a class="reference external" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference external" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
 
 </div>

Modified: trunk/libs/graph_parallel/doc/index.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/index.rst	(original)
+++ trunk/libs/graph_parallel/doc/index.rst	2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
@@ -55,6 +55,7 @@
   - `R-MAT generator`_
   - `Sorted R-MAT generator`_
   - `Unique R-MAT generator`_
+  - `Sorted unique R-MAT generator`_
   - `Scalable R-MAT generator`_
   - `Erdos-Renyi generator`_
   - `Sorted Erdos-Renyi generator`_
@@ -123,6 +124,7 @@
 .. _R-MAT generator: rmat_generator.html
 .. _Sorted R-MAT generator: sorted_rmat_generator.html
 .. _Unique R-MAT generator: unique_rmat_generator.html
+.. _Sorted unique R-MAT generator: sorted_unique_rmat_generator.html
 .. _Scalable R-MAT generator: scalable_rmat_generator.html
 .. _Erdos-Renyi generator: http://www.boost.org/libs/graph/doc/erdos_renyi_generator.html
 .. _Sorted Erdos-Renyi generator: http://www.boost.org/libs/graph/doc/sorted_erdos_renyi_gen.html

Modified: trunk/libs/graph_parallel/doc/overview.rst
==============================================================================
--- trunk/libs/graph_parallel/doc/overview.rst	(original)
+++ trunk/libs/graph_parallel/doc/overview.rst	2009-04-11 13:37:50 EDT (Sat, 11 Apr 2009)
@@ -7,7 +7,7 @@
 An Overview of the Parallel Boost Graph Library
 ===============================================
 
-.. image:: graph.png
+.. image:: ../graph.png
   :width: 206
   :height: 184
   :alt: An example graph
@@ -26,7 +26,7 @@
 typical directed graph, where *a-i* are the vertices and the arrows
 represent edges.
 
-.. image:: distributed-graph.png
+.. image:: ../distributed-graph.png
   :width: 229
   :height: 199
   :alt: A distributed graph
@@ -65,13 +65,13 @@
 the processor that "owns" (stores) that vertex. The following figure
 illustrates the distributed adjacency list representation.
 
-.. image:: dist-adjlist.png
+.. image:: ../dist-adjlist.png
   :width: 446
   :height: 154
   :alt: A distributed adjacency list
   :align: center
 
-.. image:: dist-pmap.png
+.. image:: ../dist-pmap.png
   :width: 271
   :height: 175
   :alt: A distributed property map
@@ -120,7 +120,7 @@
    - a distributed graph, on which the breadth-first search is
      operating.
 
-.. image:: architecture.png
+.. image:: ../architecture.png
   :width: 485
   :height: 410
   :alt: Parallel Boost Graph Library architecture
@@ -133,4 +133,4 @@
 Authors: Douglas Gregor and Andrew Lumsdaine
 
 .. _Distributed adjacency list: distributed_adjacency_list.html
-.. _Process groups: 
\ No newline at end of file
+.. _Process groups: