Boost-Commit :

Date view	Thread view	Subject view	Author view

From: dgregor_at_[hidden]
Date: 2007-11-05 16:43:36

Next message: eric_at_[hidden]: "[Boost-commit] svn:boost r40814 - branches/proto/v3"
Previous message: dgregor_at_[hidden]: "[Boost-commit] svn:boost r40812 - in trunk/libs/graph: build/python example/python src/python test/python"

Author: dgregor
Date: 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
New Revision: 40813
URL: http://svn.boost.org/trac/boost/changeset/40813

Log:
Merge in Boost.Graph changes from RC_1_34_0 branch
Removed:
   trunk/libs/graph/example/Jamfile
   trunk/libs/graph/example/regrtest.py
Properties modified:
   trunk/boost/graph/max_cardinality_matching.hpp (props changed)
   trunk/boost/graph/two_bit_color_map.hpp (props changed)
   trunk/libs/graph/doc/lengauer_tarjan_dominator.htm (props changed)
   trunk/libs/graph/doc/sorted_erdos_renyi_gen.html (props changed)
   trunk/libs/graph/test/adj_list_edge_list_set.cpp (props changed)
   trunk/libs/graph/test/serialize.cpp (contents, props changed)
Text files modified:
   trunk/boost/graph/adj_list_serialize.hpp | 1
   trunk/boost/graph/adjacency_matrix.hpp | 7 ++
   trunk/boost/graph/detail/adjacency_list.hpp | 2
   trunk/boost/graph/filtered_graph.hpp | 11 +++
   trunk/libs/graph/doc/AStarHeuristic.html | 10 +--
   trunk/libs/graph/doc/AStarVisitor.html | 10 +--
   trunk/libs/graph/doc/AdjacencyGraph.html | 10 +--
   trunk/libs/graph/doc/AdjacencyMatrix.html | 10 +--
   trunk/libs/graph/doc/BFSVisitor.html | 10 +--
   trunk/libs/graph/doc/BasicMatrix.html | 10 +--
   trunk/libs/graph/doc/BellmanFordVisitor.html | 10 +--
   trunk/libs/graph/doc/BidirectionalGraph.html | 10 +--
   trunk/libs/graph/doc/Buffer.html | 10 +--
   trunk/libs/graph/doc/ColorValue.html | 10 +--
   trunk/libs/graph/doc/DFSVisitor.html | 10 +--
   trunk/libs/graph/doc/DijkstraVisitor.html | 10 +--
   trunk/libs/graph/doc/EdgeListGraph.html | 10 +--
   trunk/libs/graph/doc/EdgeMutableGraph.html | 10 +--
   trunk/libs/graph/doc/EventVisitor.html | 10 +--
   trunk/libs/graph/doc/EventVisitorList.html | 10 +--
   trunk/libs/graph/doc/Graph.html | 10 +--
   trunk/libs/graph/doc/IncidenceGraph.html | 10 +--
   trunk/libs/graph/doc/IteratorConstructibleGraph.html | 10 +--
   trunk/libs/graph/doc/Makefile | 6 ++
   trunk/libs/graph/doc/Monoid.html | 10 +--
   trunk/libs/graph/doc/MutableGraph.html | 10 +--
   trunk/libs/graph/doc/MutablePropertyGraph.html | 10 +--
   trunk/libs/graph/doc/PropertyGraph.html | 10 +--
   trunk/libs/graph/doc/PropertyTag.html | 10 +--
   trunk/libs/graph/doc/VertexAndEdgeListGraph.html | 10 +--
   trunk/libs/graph/doc/VertexListGraph.html | 10 +--
   trunk/libs/graph/doc/VertexMutableGraph.html | 10 +--
   trunk/libs/graph/doc/acknowledgements.html | 10 +--
   trunk/libs/graph/doc/adjacency_iterator.html | 7 ++
   trunk/libs/graph/doc/adjacency_list.html | 10 +--
   trunk/libs/graph/doc/adjacency_list_traits.html | 10 +--
   trunk/libs/graph/doc/adjacency_matrix.html | 10 +--
   trunk/libs/graph/doc/astar_heuristic.html | 10 +--
   trunk/libs/graph/doc/astar_search.html | 10 +--
   trunk/libs/graph/doc/astar_visitor.html | 10 +--
   trunk/libs/graph/doc/bandwidth.html | 10 +--
   trunk/libs/graph/doc/bc_clustering.html | 7 ++
   trunk/libs/graph/doc/bellman_ford_shortest.html | 10 +--
   trunk/libs/graph/doc/bellman_visitor.html | 10 +--
   trunk/libs/graph/doc/betweenness_centrality.html | 7 ++
   trunk/libs/graph/doc/bfs_visitor.html | 10 +--
   trunk/libs/graph/doc/bgl_named_params.html | 10 +--
   trunk/libs/graph/doc/bibliography.html | 10 +--
   trunk/libs/graph/doc/breadth_first_search.html | 10 +--
   trunk/libs/graph/doc/breadth_first_visit.html | 10 +--
   trunk/libs/graph/doc/challenge.html | 10 +--
   trunk/libs/graph/doc/circle_layout.html | 9 ++
   trunk/libs/graph/doc/compressed_sparse_row.html | 7 ++
   trunk/libs/graph/doc/connected_components.html | 10 +--
   trunk/libs/graph/doc/constructing_algorithms.html | 10 +--
   trunk/libs/graph/doc/copy_graph.html | 10 +--
   trunk/libs/graph/doc/cuthill_mckee_ordering.html | 10 +--
   trunk/libs/graph/doc/dag_shortest_paths.html | 10 +--
   trunk/libs/graph/doc/default.css | 7 ++
   trunk/libs/graph/doc/depth_first_search.html | 10 +--
   trunk/libs/graph/doc/depth_first_visit.html | 10 +--
   trunk/libs/graph/doc/dfs_visitor.html | 10 +--
   trunk/libs/graph/doc/dijkstra_shortest_paths.html | 10 +--
   trunk/libs/graph/doc/dijkstra_visitor.html | 10 +--
   trunk/libs/graph/doc/distance_recorder.html | 10 +--
   trunk/libs/graph/doc/edge_list.html | 10 +--
   trunk/libs/graph/doc/edmunds_karp_max_flow.html | 10 +--
   trunk/libs/graph/doc/exception.html | 10 +--
   trunk/libs/graph/doc/faq.html | 10 +--
   trunk/libs/graph/doc/figs/Makefile | 5 +
   trunk/libs/graph/doc/file_dependency_example.html | 113 +++++++++++----------------------------
   trunk/libs/graph/doc/filtered_graph.html | 10 +--
   trunk/libs/graph/doc/floyd_warshall_shortest.html | 7 ++
   trunk/libs/graph/doc/fruchterman_reingold.html | 8 ++
   trunk/libs/graph/doc/graph_coloring.html | 10 +--
   trunk/libs/graph/doc/graph_concepts.html | 10 +--
   trunk/libs/graph/doc/graph_theory_review.html | 10 +--
   trunk/libs/graph/doc/graph_traits.html | 10 +--
   trunk/libs/graph/doc/gursoy_atun_layout.html | 7 ++
   trunk/libs/graph/doc/history.html | 11 +--
   trunk/libs/graph/doc/incident.html | 10 +--
   trunk/libs/graph/doc/incremental_components.html | 10 +--
   trunk/libs/graph/doc/index.html | 10 +--
   trunk/libs/graph/doc/inv_adjacency_iterator.html | 7 ++
   trunk/libs/graph/doc/isomorphism.html | 10 +--
   trunk/libs/graph/doc/johnson_all_pairs_shortest.html | 10 +--
   trunk/libs/graph/doc/jwebfrob.pl | 5 +
   trunk/libs/graph/doc/kamada_kawai_spring_layout.html | 7 ++
   trunk/libs/graph/doc/kevin_bacon.html | 10 +--
   trunk/libs/graph/doc/king_ordering.html | 10 +--
   trunk/libs/graph/doc/known_problems.html | 10 +--
   trunk/libs/graph/doc/kruskal_min_spanning_tree.html | 10 +--
   trunk/libs/graph/doc/layout_tolerance.html | 9 ++
   trunk/libs/graph/doc/leda_conversion.html | 10 +--
   trunk/libs/graph/doc/minimum_degree_ordering.html | 10 +--
   trunk/libs/graph/doc/null_visitor.html | 10 +--
   trunk/libs/graph/doc/opposite.html | 10 +--
   trunk/libs/graph/doc/predecessor_recorder.html | 10 +--
   trunk/libs/graph/doc/prim_minimum_spanning_tree.html | 10 +--
   trunk/libs/graph/doc/profile.htm | 10 +--
   trunk/libs/graph/doc/property.html | 10 +--
   trunk/libs/graph/doc/property_map.html | 10 +--
   trunk/libs/graph/doc/property_writer.html | 10 +--
   trunk/libs/graph/doc/publications.html | 10 +--
   trunk/libs/graph/doc/push_relabel_max_flow.html | 10 +--
   trunk/libs/graph/doc/python.html | 7 ++
   trunk/libs/graph/doc/quick_tour.html | 10 +--
   trunk/libs/graph/doc/random.html | 7 ++
   trunk/libs/graph/doc/random_layout.html | 7 ++
   trunk/libs/graph/doc/read_graphviz.html | 9 ++
   trunk/libs/graph/doc/read_graphviz.rst | 6 +
   trunk/libs/graph/doc/reverse_graph.html | 10 +-
   trunk/libs/graph/doc/sequential_vertex_coloring.html | 7 ++
   trunk/libs/graph/doc/sloan_ordering.htm | 14 +---
   trunk/libs/graph/doc/sloan_start_end_vertices.htm | 10 +--
   trunk/libs/graph/doc/sparse_matrix_ordering.html | 10 +--
   trunk/libs/graph/doc/stanford_graph.html | 11 +--
   trunk/libs/graph/doc/strong_components.html | 10 +--
   trunk/libs/graph/doc/subgraph.html | 10 +--
   trunk/libs/graph/doc/table_of_contents.html | 12 +--
   trunk/libs/graph/doc/time_stamper.html | 10 +--
   trunk/libs/graph/doc/topological_sort.html | 10 +--
   trunk/libs/graph/doc/transitive_closure.html | 10 +--
   trunk/libs/graph/doc/transpose_graph.html | 10 +--
   trunk/libs/graph/doc/trouble_shooting.html | 10 +--
   trunk/libs/graph/doc/undirected_dfs.html | 10 +--
   trunk/libs/graph/doc/users.html | 7 ++
   trunk/libs/graph/doc/using_adjacency_list.html | 10 +--
   trunk/libs/graph/doc/using_property_maps.html | 10 +--
   trunk/libs/graph/doc/visitor_concepts.html | 10 +--
   trunk/libs/graph/doc/wavefront.htm | 10 +--
   trunk/libs/graph/doc/write-graphviz.html | 10 +--
   trunk/libs/graph/example/cuthill_mckee_ordering.cpp | 22 +------
   trunk/libs/graph/example/data1.txt | 5 +
   trunk/libs/graph/example/data2.txt | 5 +
   trunk/libs/graph/example/data3.txt | 5 +
   trunk/libs/graph/example/file_dependencies.cpp | 84 +++++++++++------------------
   trunk/libs/graph/example/king_ordering.cpp | 22 +------
   trunk/libs/graph/example/property_iterator.cpp | 9 +-
   trunk/libs/graph/example/sloan_ordering.cpp | 22 +------
   trunk/libs/graph/index.html | 7 ++
   trunk/libs/graph/test/Jamfile.v2 | 6 ++
   trunk/libs/graph/test/bidir_remove_edge.cpp | 2
   trunk/libs/graph/test/cuthill_mckee_ordering.cpp | 22 +------
   trunk/libs/graph/test/dag_longest_paths.cpp | 5 +
   trunk/libs/graph/test/dijkstra_heap_performance.cpp | 5 -
   trunk/libs/graph/test/dominator_tree_test.cpp | 8 +-
   trunk/libs/graph/test/king_ordering.cpp | 22 +------
   trunk/libs/graph/test/serialize.cpp | 6 ++
   149 files changed, 621 insertions(+), 983 deletions(-)

Modified: trunk/boost/graph/adj_list_serialize.hpp
==============================================================================
--- trunk/boost/graph/adj_list_serialize.hpp (original)
+++ trunk/boost/graph/adj_list_serialize.hpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -19,6 +19,7 @@
#include <boost/serialization/split_free.hpp>

namespace boost {
+
namespace serialization {

// Turn off tracking for adjacency_list. It's not polymorphic, and we

Modified: trunk/boost/graph/adjacency_matrix.hpp
==============================================================================
--- trunk/boost/graph/adjacency_matrix.hpp (original)
+++ trunk/boost/graph/adjacency_matrix.hpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -28,6 +28,7 @@
#include <boost/graph/properties.hpp>
#include <boost/tuple/tuple.hpp>
#include <boost/static_assert.hpp>
+#include <boost/type_traits/ice.hpp>

namespace boost {

@@ -436,7 +437,9 @@
     // graph type. Instead, use directedS, which also provides the
     // functionality required for a Bidirectional Graph (in_edges,
     // in_degree, etc.).
- BOOST_STATIC_ASSERT(!(is_same<Directed, bidirectionalS>::value));
+#if !defined(_MSC_VER) || _MSC_VER > 1300
+ BOOST_STATIC_ASSERT(type_traits::ice_not<(is_same<Directed, bidirectionalS>::value)>::value);
+#endif

     typedef typename mpl::if_<is_directed,
                                     bidirectional_tag, undirected_tag>::type
@@ -471,11 +474,13 @@
     typedef adjacency_matrix_traits<Directed> Traits;

   public:
+#if !defined(BOOST_MSVC) || BOOST_MSVC > 1300
     // The bidirectionalS tag is not allowed with the adjacency_matrix
     // graph type. Instead, use directedS, which also provides the
     // functionality required for a Bidirectional Graph (in_edges,
     // in_degree, etc.).
     BOOST_STATIC_ASSERT(!(is_same<Directed, bidirectionalS>::value));
+#endif

#ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES
     typedef typename detail::retag_property_list<vertex_bundle_t, VertexProperty>::type

Modified: trunk/boost/graph/detail/adjacency_list.hpp
==============================================================================
--- trunk/boost/graph/detail/adjacency_list.hpp (original)
+++ trunk/boost/graph/detail/adjacency_list.hpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -61,7 +61,7 @@

Note: it would be nice to merge some of the undirected and
- bidirectional code... it is aweful similar.
+ bidirectional code... it is awful similar.
*/

Modified: trunk/boost/graph/filtered_graph.hpp
==============================================================================
--- trunk/boost/graph/filtered_graph.hpp (original)
+++ trunk/boost/graph/filtered_graph.hpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -246,6 +246,17 @@
     return filtered_graph<Graph, EdgePredicate, VertexPredicate>(g, ep, vp);
   }

+ template <typename Graph, typename EdgePredicate>
+ inline filtered_graph<const Graph, EdgePredicate>
+ make_filtered_graph(const Graph& g, EdgePredicate ep) {
+ return filtered_graph<const Graph, EdgePredicate>(g, ep);
+ }
+ template <typename Graph, typename EdgePredicate, typename VertexPredicate>
+ inline filtered_graph<const Graph, EdgePredicate, VertexPredicate>
+ make_filtered_graph(const Graph& g, EdgePredicate ep, VertexPredicate vp) {
+ return filtered_graph<const Graph, EdgePredicate, VertexPredicate>(g, ep, vp);
+ }
+
   template <typename G, typename EP, typename VP>
   std::pair<typename filtered_graph<G, EP, VP>::vertex_iterator,
             typename filtered_graph<G, EP, VP>::vertex_iterator>

Modified: trunk/libs/graph/doc/AStarHeuristic.html
==============================================================================
--- trunk/libs/graph/doc/AStarHeuristic.html (original)
+++ trunk/libs/graph/doc/AStarHeuristic.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: AStarHeuristic</Title>

Modified: trunk/libs/graph/doc/AStarVisitor.html
==============================================================================
--- trunk/libs/graph/doc/AStarVisitor.html (original)
+++ trunk/libs/graph/doc/AStarVisitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: AStarVisitor</Title>

Modified: trunk/libs/graph/doc/AdjacencyGraph.html
==============================================================================
--- trunk/libs/graph/doc/AdjacencyGraph.html (original)
+++ trunk/libs/graph/doc/AdjacencyGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>AdjacencyGraph</Title>

Modified: trunk/libs/graph/doc/AdjacencyMatrix.html
==============================================================================
--- trunk/libs/graph/doc/AdjacencyMatrix.html (original)
+++ trunk/libs/graph/doc/AdjacencyMatrix.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>AdjacencyMatrix</Title>

Modified: trunk/libs/graph/doc/BFSVisitor.html
==============================================================================
--- trunk/libs/graph/doc/BFSVisitor.html (original)
+++ trunk/libs/graph/doc/BFSVisitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: BFSVisitor</Title>

Modified: trunk/libs/graph/doc/BasicMatrix.html
==============================================================================
--- trunk/libs/graph/doc/BasicMatrix.html (original)
+++ trunk/libs/graph/doc/BasicMatrix.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>BasicMatrix</Title>

Modified: trunk/libs/graph/doc/BellmanFordVisitor.html
==============================================================================
--- trunk/libs/graph/doc/BellmanFordVisitor.html (original)
+++ trunk/libs/graph/doc/BellmanFordVisitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Bellman Ford Visitor</Title>

Modified: trunk/libs/graph/doc/BidirectionalGraph.html
==============================================================================
--- trunk/libs/graph/doc/BidirectionalGraph.html (original)
+++ trunk/libs/graph/doc/BidirectionalGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Bidirectional</Title>

Modified: trunk/libs/graph/doc/Buffer.html
==============================================================================
--- trunk/libs/graph/doc/Buffer.html (original)
+++ trunk/libs/graph/doc/Buffer.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Buffer</Title>

Modified: trunk/libs/graph/doc/ColorValue.html
==============================================================================
--- trunk/libs/graph/doc/ColorValue.html (original)
+++ trunk/libs/graph/doc/ColorValue.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: ColorValue Concept</Title>

Modified: trunk/libs/graph/doc/DFSVisitor.html
==============================================================================
--- trunk/libs/graph/doc/DFSVisitor.html (original)
+++ trunk/libs/graph/doc/DFSVisitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>DFS Visitor</Title>

Modified: trunk/libs/graph/doc/DijkstraVisitor.html
==============================================================================
--- trunk/libs/graph/doc/DijkstraVisitor.html (original)
+++ trunk/libs/graph/doc/DijkstraVisitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Dijkstra Visitor</Title>

Modified: trunk/libs/graph/doc/EdgeListGraph.html
==============================================================================
--- trunk/libs/graph/doc/EdgeListGraph.html (original)
+++ trunk/libs/graph/doc/EdgeListGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>EdgeListGraph</Title>

Modified: trunk/libs/graph/doc/EdgeMutableGraph.html
==============================================================================
--- trunk/libs/graph/doc/EdgeMutableGraph.html (original)
+++ trunk/libs/graph/doc/EdgeMutableGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Edge Mutable Graph</Title>

Modified: trunk/libs/graph/doc/EventVisitor.html
==============================================================================
--- trunk/libs/graph/doc/EventVisitor.html (original)
+++ trunk/libs/graph/doc/EventVisitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: EventVisitor</Title>

Modified: trunk/libs/graph/doc/EventVisitorList.html
==============================================================================
--- trunk/libs/graph/doc/EventVisitorList.html (original)
+++ trunk/libs/graph/doc/EventVisitorList.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: EventVisitorList</Title>

Modified: trunk/libs/graph/doc/Graph.html
==============================================================================
--- trunk/libs/graph/doc/Graph.html (original)
+++ trunk/libs/graph/doc/Graph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Graph</Title>

Modified: trunk/libs/graph/doc/IncidenceGraph.html
==============================================================================
--- trunk/libs/graph/doc/IncidenceGraph.html (original)
+++ trunk/libs/graph/doc/IncidenceGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>IncidenceGraph</Title>

Modified: trunk/libs/graph/doc/IteratorConstructibleGraph.html
==============================================================================
--- trunk/libs/graph/doc/IteratorConstructibleGraph.html (original)
+++ trunk/libs/graph/doc/IteratorConstructibleGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>IteratorConstructibleGraph</Title>

Modified: trunk/libs/graph/doc/Makefile
==============================================================================
--- trunk/libs/graph/doc/Makefile (original)
+++ trunk/libs/graph/doc/Makefile 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,3 +1,9 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under 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)
+
DVIPS = dvips

LATEX = latex

Modified: trunk/libs/graph/doc/Monoid.html
==============================================================================
--- trunk/libs/graph/doc/Monoid.html (original)
+++ trunk/libs/graph/doc/Monoid.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Monoid</Title>

Modified: trunk/libs/graph/doc/MutableGraph.html
==============================================================================
--- trunk/libs/graph/doc/MutableGraph.html (original)
+++ trunk/libs/graph/doc/MutableGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>MutableGraph</Title>

Modified: trunk/libs/graph/doc/MutablePropertyGraph.html
==============================================================================
--- trunk/libs/graph/doc/MutablePropertyGraph.html (original)
+++ trunk/libs/graph/doc/MutablePropertyGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>MutablePropertyGraph</Title>

Modified: trunk/libs/graph/doc/PropertyGraph.html
==============================================================================
--- trunk/libs/graph/doc/PropertyGraph.html (original)
+++ trunk/libs/graph/doc/PropertyGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>PropertyGraph</Title>

Modified: trunk/libs/graph/doc/PropertyTag.html
==============================================================================
--- trunk/libs/graph/doc/PropertyTag.html (original)
+++ trunk/libs/graph/doc/PropertyTag.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Property</Title>

Modified: trunk/libs/graph/doc/VertexAndEdgeListGraph.html
==============================================================================
--- trunk/libs/graph/doc/VertexAndEdgeListGraph.html (original)
+++ trunk/libs/graph/doc/VertexAndEdgeListGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>VertexAndEdgeListGraph</Title>

Modified: trunk/libs/graph/doc/VertexListGraph.html
==============================================================================
--- trunk/libs/graph/doc/VertexListGraph.html (original)
+++ trunk/libs/graph/doc/VertexListGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>VertexListGraph</Title>

Modified: trunk/libs/graph/doc/VertexMutableGraph.html
==============================================================================
--- trunk/libs/graph/doc/VertexMutableGraph.html (original)
+++ trunk/libs/graph/doc/VertexMutableGraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Vertex Mutable Graph</Title>

Modified: trunk/libs/graph/doc/acknowledgements.html
==============================================================================
--- trunk/libs/graph/doc/acknowledgements.html (original)
+++ trunk/libs/graph/doc/acknowledgements.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Acknowledgements</Title>

Modified: trunk/libs/graph/doc/adjacency_iterator.html
==============================================================================
--- trunk/libs/graph/doc/adjacency_iterator.html (original)
+++ trunk/libs/graph/doc/adjacency_iterator.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<html>
+

<head>
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">

Modified: trunk/libs/graph/doc/adjacency_list.html
==============================================================================
--- trunk/libs/graph/doc/adjacency_list.html (original)
+++ trunk/libs/graph/doc/adjacency_list.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Adjacency List</Title>

Modified: trunk/libs/graph/doc/adjacency_list_traits.html
==============================================================================
--- trunk/libs/graph/doc/adjacency_list_traits.html (original)
+++ trunk/libs/graph/doc/adjacency_list_traits.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Graph Traits</Title>

Modified: trunk/libs/graph/doc/adjacency_matrix.html
==============================================================================
--- trunk/libs/graph/doc/adjacency_matrix.html (original)
+++ trunk/libs/graph/doc/adjacency_matrix.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Adjacency Matrix</Title>

Modified: trunk/libs/graph/doc/astar_heuristic.html
==============================================================================
--- trunk/libs/graph/doc/astar_heuristic.html (original)
+++ trunk/libs/graph/doc/astar_heuristic.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: astar_heuristic</Title>

Modified: trunk/libs/graph/doc/astar_search.html
==============================================================================
--- trunk/libs/graph/doc/astar_search.html (original)
+++ trunk/libs/graph/doc/astar_search.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: A* Heuristic Search</Title>

Modified: trunk/libs/graph/doc/astar_visitor.html
==============================================================================
--- trunk/libs/graph/doc/astar_visitor.html (original)
+++ trunk/libs/graph/doc/astar_visitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: astar_visitor</Title>

Modified: trunk/libs/graph/doc/bandwidth.html
==============================================================================
--- trunk/libs/graph/doc/bandwidth.html (original)
+++ trunk/libs/graph/doc/bandwidth.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Bandwidth</Title>

Modified: trunk/libs/graph/doc/bc_clustering.html
==============================================================================
--- trunk/libs/graph/doc/bc_clustering.html (original)
+++ trunk/libs/graph/doc/bc_clustering.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+
<html>
<head>
<meta name="generator" content=

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Bellman Ford Shortest Paths</Title>

Modified: trunk/libs/graph/doc/bellman_visitor.html
==============================================================================
--- trunk/libs/graph/doc/bellman_visitor.html (original)
+++ trunk/libs/graph/doc/bellman_visitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: bellman_visitor</Title>

Modified: trunk/libs/graph/doc/betweenness_centrality.html
==============================================================================
--- trunk/libs/graph/doc/betweenness_centrality.html (original)
+++ trunk/libs/graph/doc/betweenness_centrality.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,5 +1,12 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
+
   <head>
     <title>Boost Graph Library: Brandes' Betweenness Centrality</title>
   </head>

Modified: trunk/libs/graph/doc/bfs_visitor.html
==============================================================================
--- trunk/libs/graph/doc/bfs_visitor.html (original)
+++ trunk/libs/graph/doc/bfs_visitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: bfs_visitor</Title>

Modified: trunk/libs/graph/doc/bgl_named_params.html
==============================================================================
--- trunk/libs/graph/doc/bgl_named_params.html (original)
+++ trunk/libs/graph/doc/bgl_named_params.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Named Parameters</Title>

Modified: trunk/libs/graph/doc/bibliography.html
==============================================================================
--- trunk/libs/graph/doc/bibliography.html (original)
+++ trunk/libs/graph/doc/bibliography.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Bibliography</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Breadth-First Search</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Breadth-First Visit</Title>

Modified: trunk/libs/graph/doc/challenge.html
==============================================================================
--- trunk/libs/graph/doc/challenge.html (original)
+++ trunk/libs/graph/doc/challenge.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Challenge</Title>

Modified: trunk/libs/graph/doc/circle_layout.html
==============================================================================
--- trunk/libs/graph/doc/circle_layout.html (original)
+++ trunk/libs/graph/doc/circle_layout.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
-<html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Function template circle_graph_layout</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center">Home</td><td align="center">Libraries</td><td align="center">People</td><td align="center">FAQ</td><td align="center">More</td></table><hr><div class="refentry" lang="en"><a name="id103562-bb"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><img src="figs/python.gif" alt="(Python)"/><span class="refentrytitle">Function template circle_graph_layout</span></h2><p>boost::circle_graph_layout — Layout the graph with
the vertices at the points of a regular n-polygon. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">
+<html>
+<head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Function template circle_graph_layout</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center">Home</td><td align="center">Libraries</td><td align="center">People</td><td align="center">FAQ</td><td align="center">More</td></table><hr><div class="refentry" lang="en"><a name="id103562-bb"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><img src="figs/python.gif" alt="(Python)"/><span class="refentrytitle">Function template circle_graph_layout</span></h2><p>boost::circle_graph_layout — Layout the graph with the v
ertices at the points of a regular n-polygon. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">
<span class="bold"><b>template</b></span><<span class="bold"><b>typename</b></span> VertexListGraph, <span class="bold"><b>typename</b></span> PositionMap, <span class="bold"><b>typename</b></span> Radius>
<span class="type"><span class="bold"><b>void</b></span></span> circle_graph_layout(<span class="bold"><b>const</b></span> VertexListGraph & g, PositionMap position,
Radius radius);</pre></div><div class="refsect1" lang="en"><a name="id821794"></a><h2>Where Defined</h2>boost/graph/circle_layout.hpp<h2>Description</h2><p>The distance from the center of the polygon to each point is determined by the <tt class="computeroutput">radius</tt> parameter. The <tt class="computeroutput">position</tt> parameter must be an Lvalue Property Map whose value type is a class type containing <tt class="computeroutput">x</tt> and <tt class="computeroutput">y</tt> members that will be set to the <tt class="computeroutput">x</tt> and <tt class="computeroutput">y</tt> coordinates.

Modified: trunk/libs/graph/doc/compressed_sparse_row.html
==============================================================================
--- trunk/libs/graph/doc/compressed_sparse_row.html (original)
+++ trunk/libs/graph/doc/compressed_sparse_row.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,5 +1,12 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
+
<head>
<title>Compressed Sparse Row Graph</title>

Modified: trunk/libs/graph/doc/connected_components.html
==============================================================================
--- trunk/libs/graph/doc/connected_components.html (original)
+++ trunk/libs/graph/doc/connected_components.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Connected Components</Title>

Modified: trunk/libs/graph/doc/constructing_algorithms.html
==============================================================================
--- trunk/libs/graph/doc/constructing_algorithms.html (original)
+++ trunk/libs/graph/doc/constructing_algorithms.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Constructing Graph Algorithms</Title>

Modified: trunk/libs/graph/doc/copy_graph.html
==============================================================================
--- trunk/libs/graph/doc/copy_graph.html (original)
+++ trunk/libs/graph/doc/copy_graph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Copy Graph</Title>

Modified: trunk/libs/graph/doc/cuthill_mckee_ordering.html
==============================================================================
--- trunk/libs/graph/doc/cuthill_mckee_ordering.html (original)
+++ trunk/libs/graph/doc/cuthill_mckee_ordering.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@



-
-
-
-
-
-
-
+ -- Distributed under 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)

<Head>
<Title>Boost Graph Library: Cuthill-Mckee Ordering</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Directed Acyclic Graph Shortest Paths</Title>

Modified: trunk/libs/graph/doc/default.css
==============================================================================
--- trunk/libs/graph/doc/default.css (original)
+++ trunk/libs/graph/doc/default.css 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -6,6 +6,13 @@
:copyright: This stylesheet has been placed in the public domain.

Default cascading style sheet for the HTML output of Docutils.
+
+-- Copyright (c) 2005 Trustees of Indiana University
+
+Distributed under 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)
+
*/

.first {

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Depth-First Search</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Depth-First Visit</Title>

Modified: trunk/libs/graph/doc/dfs_visitor.html
==============================================================================
--- trunk/libs/graph/doc/dfs_visitor.html (original)
+++ trunk/libs/graph/doc/dfs_visitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: dfs_visitor</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Dijkstra's Shortest Paths</Title>

Modified: trunk/libs/graph/doc/dijkstra_visitor.html
==============================================================================
--- trunk/libs/graph/doc/dijkstra_visitor.html (original)
+++ trunk/libs/graph/doc/dijkstra_visitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: dijkstra_visitor</Title>

Modified: trunk/libs/graph/doc/distance_recorder.html
==============================================================================
--- trunk/libs/graph/doc/distance_recorder.html (original)
+++ trunk/libs/graph/doc/distance_recorder.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: distance_recorder</Title>

Modified: trunk/libs/graph/doc/edge_list.html
==============================================================================
--- trunk/libs/graph/doc/edge_list.html (original)
+++ trunk/libs/graph/doc/edge_list.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Edge List Class</Title>

Modified: trunk/libs/graph/doc/edmunds_karp_max_flow.html
==============================================================================
--- trunk/libs/graph/doc/edmunds_karp_max_flow.html (original)
+++ trunk/libs/graph/doc/edmunds_karp_max_flow.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Edmunds-Karp Maximum Flow</Title>

Modified: trunk/libs/graph/doc/exception.html
==============================================================================
--- trunk/libs/graph/doc/exception.html (original)
+++ trunk/libs/graph/doc/exception.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Exceptions</Title>

Modified: trunk/libs/graph/doc/faq.html
==============================================================================
--- trunk/libs/graph/doc/faq.html (original)
+++ trunk/libs/graph/doc/faq.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: FAQ</Title>

Modified: trunk/libs/graph/doc/figs/Makefile
==============================================================================
--- trunk/libs/graph/doc/figs/Makefile (original)
+++ trunk/libs/graph/doc/figs/Makefile 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,9 @@
# -*- makefile -*-
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under 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)

.SUFFIXES: .fig .gif .tif .jpeg

Modified: trunk/libs/graph/doc/file_dependency_example.html
==============================================================================
--- trunk/libs/graph/doc/file_dependency_example.html (original)
+++ trunk/libs/graph/doc/file_dependency_example.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>File Dependency Example</Title>
@@ -105,7 +101,7 @@
<TT>adjacency_list</TT> class to represent the graph. The
<TT>vecS</TT> selector means that a <TT>std::vector</TT> will be used
to represent each edge-list, which provides efficient traversal. The
-<TT>directedS</TT> selector means we want a directed graph, and the
+<TT>bidirectionalS</TT> selector means we want a directed graph with access to both the edges outgoing from each vertex and the edges incoming to each vertex, and the
<TT>color_property</TT> attaches a color property to each vertex of the
graph. The color property will be used in several of the algorithms in
the following sections.
@@ -140,9 +136,8 @@
   };

   using namespace boost;
- typedef adjacency_list<vecS, vecS, directedS,
- property<vertex_color_t, default_color_type>,
- property<edge_weight_t, int>
+ typedef adjacency_list<vecS, vecS, bidirectionalS,
+ property<vertex_color_t, default_color_type>
     > Graph;
   Graph g(used_by, used_by + sizeof(used_by) / sizeof(Edge), N);
   typedef graph_traits<Graph>::vertex_descriptor Vertex;
@@ -208,86 +203,42 @@
number of files can be built at the same time? The main criteria for
when a file can be built is that all of the files it depends on must
already be built. To simplify things for this example, we'll assume
-that each file takes 1 time unit to build (even header files). The
+that each file takes 1 time unit to build (even header files). For
+parallel compilation, we can build all of the files corresponding to
+vertices with no dependencies, e.g., those that have
+an <i>in-degree</i> of 0, in the first step. For all other files, the
main observation for determining the ``time slot'' for a file is that
the time slot must be one more than the maximum time-slot of the files
it depends on.

-<P>
-This idea of calculating a value based on the previously computed
-values of neighboring vertices is the same idea behind Dijkstra's
-single-source shortest paths algorithm (see <a
-href="./dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths()</tt></a>). The
-main difference between this situation and a shortest-path algorithm
-is that we want to use the maximum of the neighbors' values instead of
-the minimum. In addition, we do not have a single source
-vertex. Instead we will want to treat all vertices with in-degree of
-zero as sources (i.e., vertices with no edges coming into them). So we
-use Dijkstra's algorithm with several extra parameters instead
-of relying on the defaults.
-
-<P>
-To use <TT>dijkstra_shortest_paths()</TT>, we must first set up the vertex
-and edge properties that will be used in the algorithm. We will need
-a time property (replacing the distance property of Dijkstra's
-algorithm) and an edge weight property. We will use a
-<TT>std::vector</TT> to store the time. The weight property has already
-been attached to the graph via a plug-in so here we just declare an
-map for the internal weight property.
+<P>We start be creating a vector <code>time</code> that will store the
+ time step at which each file can be built. We initialize every value
+ with time step zero.</p>

<P>
<PRE>
   std::vector<int> time(N, 0);
- typedef std::vector<int>::iterator Time;
- using boost::edge_weight_t;
- typedef boost::property_map<Graph, edge_weight_t>::type Weight;
- Weight weight = get(edge_weight, g);
</PRE>

-<P>
-The next step is to identify the vertices with zero in-degree which
-will be our ``source'' vertices from which to start the shortest path
-searches. The in-degrees can be calculated with the following loop.
-
-<P>
-<PRE>
- std::vector<int> in_degree(N, 0);
- Graph::vertex_iterator i, iend;
- Graph::out_edge_iterator j, jend;
- for (boost::tie(i, iend) = vertices(g); i != iend; ++i)
- for (boost::tie(j, jend) = out_edges(*i, g); j != jend; ++j)
- in_degree[target(*j, g)] += 1;
-</PRE>
-
-<P>
-Next we need to define comparison of the "cost". In this
-case we want each file to have a time stamp greater than any of its
-predecessors. Therefore we define comparison with the
-<TT>std::greater<int></TT> function object. We also need to
-tell the algorithm that we want to use addition to combine time
-values, so we use <TT>std::plus<int></TT>.
-
-<P>
-<PRE>
- std::greater<int> compare;
- std::plus<int> combine;
-</PRE>
-
-<P>
-We are now ready to call <TT>uniform_cost_search()</TT>. We just
-loop through all the vertices in the graph, and invoke the algorithm
-if the vertex has zero in-degree.
-
-<P>
-<PRE>
- for (boost::tie(i, iend) = vertices(g); i != iend; ++i)
- if (in_degree[*i] == 0)
- boost::dijkstra_shortest_paths(g, *i,
- distance_map(&time[0]).
- weight_map(weight).
- distance_compare(compare).
- distance_combine(combine));
-</PRE>
+<p>Now, we want to visit the vertices against in topological order,
+ from those files that need to be built first until those that need
+ to be built last. However, instead of printing out the order
+ immediately, we will compute the time step in which each file should
+ be built based on the time steps of the files it depends on. We
+ only need to consider those files whose in-degree is greater than
+ zero.</p>
+
+<pre>
+ for (i = make_order.begin(); i != make_order.end(); ++i) {
+ if (in_degree (*i, g) > 0) {
+ Graph::in_edge_iterator j, j_end;
+ int maxdist = 0;
+ for (tie(j, j_end) = in_edges(*i, g); j != j_end; ++j)
+ maxdist = std::max(time[source(*j, g)], maxdist);
+ time[*i]=maxdist+1;
+ }
+ }
+</pre>

<P>
Last, we output the time-slot that we've calculated for each vertex.

Modified: trunk/libs/graph/doc/filtered_graph.html
==============================================================================
--- trunk/libs/graph/doc/filtered_graph.html (original)
+++ trunk/libs/graph/doc/filtered_graph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Filtered Graph</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<HTML>
+
<Head>
<Title>Floyd-Warshall All Pairs Shortest Paths</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"

Modified: trunk/libs/graph/doc/fruchterman_reingold.html
==============================================================================
--- trunk/libs/graph/doc/fruchterman_reingold.html (original)
+++ trunk/libs/graph/doc/fruchterman_reingold.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,12 @@
<HTML>
+
+
<Head>
<Title>Boost Graph Library: Fruchterman-Reingold Force-Directed Layout</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"

Modified: trunk/libs/graph/doc/graph_coloring.html
==============================================================================
--- trunk/libs/graph/doc/graph_coloring.html (original)
+++ trunk/libs/graph/doc/graph_coloring.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Graph Coloring Example</Title>

Modified: trunk/libs/graph/doc/graph_concepts.html
==============================================================================
--- trunk/libs/graph/doc/graph_concepts.html (original)
+++ trunk/libs/graph/doc/graph_concepts.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Concepts</Title>

Modified: trunk/libs/graph/doc/graph_theory_review.html
==============================================================================
--- trunk/libs/graph/doc/graph_theory_review.html (original)
+++ trunk/libs/graph/doc/graph_theory_review.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Graph Theory Review</Title>

Modified: trunk/libs/graph/doc/graph_traits.html
==============================================================================
--- trunk/libs/graph/doc/graph_traits.html (original)
+++ trunk/libs/graph/doc/graph_traits.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Graph Traits</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<HTML>
+
<Head>
<Title>Boost Graph Library: Gürsoy-Atun Layout</Title>
<script language="JavaScript" type="text/JavaScript">

Modified: trunk/libs/graph/doc/history.html
==============================================================================
--- trunk/libs/graph/doc/history.html (original)
+++ trunk/libs/graph/doc/history.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: History</Title>
@@ -105,6 +101,7 @@
       <li>sorted_erdos_renyi_iterator, from Jeremiah Willcock of Indiana University.</li>
     </ul><br><b>Enhancements</b><br>
     <ul>
+ <li>Note: the name of the compiled library for GraphViz reading is now called <code>boost_graph</code> rather than <code>bgl-viz</code>.</li>
       <li>biconnected_components now has a visitor parameter and supports named parameters, from Janusz Piwowarski.</li>
       <li>adjacency_matrix now models the Bidirectional Graph concept.</li>
                              <li>adjacency_list is now Serializable, from Jeremy Siek of Rice University.</li>

Modified: trunk/libs/graph/doc/incident.html
==============================================================================
--- trunk/libs/graph/doc/incident.html (original)
+++ trunk/libs/graph/doc/incident.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: incident</Title>

Modified: trunk/libs/graph/doc/incremental_components.html
==============================================================================
--- trunk/libs/graph/doc/incremental_components.html (original)
+++ trunk/libs/graph/doc/incremental_components.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Incremental Connected Components</Title>

Modified: trunk/libs/graph/doc/index.html
==============================================================================
--- trunk/libs/graph/doc/index.html (original)
+++ trunk/libs/graph/doc/index.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>The Boost Graph Library</Title>

Modified: trunk/libs/graph/doc/inv_adjacency_iterator.html
==============================================================================
--- trunk/libs/graph/doc/inv_adjacency_iterator.html (original)
+++ trunk/libs/graph/doc/inv_adjacency_iterator.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<html>
+

<head>
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">

Modified: trunk/libs/graph/doc/isomorphism.html
==============================================================================
--- trunk/libs/graph/doc/isomorphism.html (original)
+++ trunk/libs/graph/doc/isomorphism.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Isomorphism</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Johnson All Pairs Shortest Paths</Title>

Modified: trunk/libs/graph/doc/jwebfrob.pl
==============================================================================
--- trunk/libs/graph/doc/jwebfrob.pl (original)
+++ trunk/libs/graph/doc/jwebfrob.pl 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under 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)

$lastpage = 0;

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,5 +1,12 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
+
<head>
<meta name="generator" content=
"HTML Tidy for Mac OS X (vers 12 April 2005), see www.w3.org">

Modified: trunk/libs/graph/doc/kevin_bacon.html
==============================================================================
--- trunk/libs/graph/doc/kevin_bacon.html (original)
+++ trunk/libs/graph/doc/kevin_bacon.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Kevin Bacon Example</Title>

Modified: trunk/libs/graph/doc/king_ordering.html
==============================================================================
--- trunk/libs/graph/doc/king_ordering.html (original)
+++ trunk/libs/graph/doc/king_ordering.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

Modified: trunk/libs/graph/doc/known_problems.html
==============================================================================
--- trunk/libs/graph/doc/known_problems.html (original)
+++ trunk/libs/graph/doc/known_problems.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Known Problems</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Kruskal Minimum Spanning Tree</Title>

Modified: trunk/libs/graph/doc/layout_tolerance.html
==============================================================================
--- trunk/libs/graph/doc/layout_tolerance.html (original)
+++ trunk/libs/graph/doc/layout_tolerance.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
-<html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Struct template layout_tolerance</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center">Home</td><td align="center">Libraries</td><td align="center">People</td><td align="center">FAQ</td><td align="center">More</td></table><hr><div class="refentry" lang="en"><a name="struct.boost.layout_tolerance"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><span class="refentrytitle">Struct template layout_tolerance</span></h2><p>boost::layout_tolerance — Determines when to terminate layout of a particular graph b
ased on a given relative tolerance. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="bold"><b>template</b></span><<span class="bold"><b>typename</b></span> T = double>
+<html>
+<head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Struct template layout_tolerance</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center">Home</td><td align="center">Libraries</td><td align="center">People</td><td align="center">FAQ</td><td align="center">More</td></table><hr><div class="refentry" lang="en"><a name="struct.boost.layout_tolerance"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><span class="refentrytitle">Struct template layout_tolerance</span></h2><p>boost::layout_tolerance — Determines when to terminate layout of a particular graph based o
n a given relative tolerance. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="bold"><b>template</b></span><<span class="bold"><b>typename</b></span> T = double>
<span class="bold"><b>struct</b></span> layout_tolerance {
<span class="emphasis"><em>// construct/copy/destruct</em></span>
layout_tolerance(<span class="bold"><b>const</b></span> T & = T(0.001));

Modified: trunk/libs/graph/doc/leda_conversion.html
==============================================================================
--- trunk/libs/graph/doc/leda_conversion.html (original)
+++ trunk/libs/graph/doc/leda_conversion.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Converting Existing Graphs to BGL</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Minimum Degree Ordering</Title>

Modified: trunk/libs/graph/doc/null_visitor.html
==============================================================================
--- trunk/libs/graph/doc/null_visitor.html (original)
+++ trunk/libs/graph/doc/null_visitor.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: null_visitor</Title>

Modified: trunk/libs/graph/doc/opposite.html
==============================================================================
--- trunk/libs/graph/doc/opposite.html (original)
+++ trunk/libs/graph/doc/opposite.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: opposite</Title>

Modified: trunk/libs/graph/doc/predecessor_recorder.html
==============================================================================
--- trunk/libs/graph/doc/predecessor_recorder.html (original)
+++ trunk/libs/graph/doc/predecessor_recorder.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: predecessor_recorder</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Prim Minimum Spanning Tree</Title>

Modified: trunk/libs/graph/doc/profile.htm
==============================================================================
--- trunk/libs/graph/doc/profile.htm (original)
+++ trunk/libs/graph/doc/profile.htm 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -4,13 +4,9 @@
<META http-equiv=Content-Type content="text/html; charset=windows-1252">
<META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD>
<BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff>

Modified: trunk/libs/graph/doc/property.html
==============================================================================
--- trunk/libs/graph/doc/property.html (original)
+++ trunk/libs/graph/doc/property.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Property</Title>

Modified: trunk/libs/graph/doc/property_map.html
==============================================================================
--- trunk/libs/graph/doc/property_map.html (original)
+++ trunk/libs/graph/doc/property_map.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Property Map Traits</Title>

Modified: trunk/libs/graph/doc/property_writer.html
==============================================================================
--- trunk/libs/graph/doc/property_writer.html (original)
+++ trunk/libs/graph/doc/property_writer.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: property_writer</Title>

Modified: trunk/libs/graph/doc/publications.html
==============================================================================
--- trunk/libs/graph/doc/publications.html (original)
+++ trunk/libs/graph/doc/publications.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Publications</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Push-Relabel Maximum Flow</Title>

Modified: trunk/libs/graph/doc/python.html
==============================================================================
--- trunk/libs/graph/doc/python.html (original)
+++ trunk/libs/graph/doc/python.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<html>
+
   <head>
     <title>Boost Graph Library: Python Bindings (Experimental)</title>
     <script language="JavaScript" type="text/JavaScript">

Modified: trunk/libs/graph/doc/quick_tour.html
==============================================================================
--- trunk/libs/graph/doc/quick_tour.html (original)
+++ trunk/libs/graph/doc/quick_tour.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -3,13 +3,9 @@


<head>

Modified: trunk/libs/graph/doc/random.html
==============================================================================
--- trunk/libs/graph/doc/random.html (original)
+++ trunk/libs/graph/doc/random.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<html>
+
<head>
<title>Boost Graph Library: random</title>

Modified: trunk/libs/graph/doc/random_layout.html
==============================================================================
--- trunk/libs/graph/doc/random_layout.html (original)
+++ trunk/libs/graph/doc/random_layout.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<HTML>
+
<Head>
<Title>Boost Graph Library: Random Graph Layout</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"

Modified: trunk/libs/graph/doc/read_graphviz.html
==============================================================================
--- trunk/libs/graph/doc/read_graphviz.html (original)
+++ trunk/libs/graph/doc/read_graphviz.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,6 +1,13 @@
<?xml version="1.0" encoding="utf-8" ?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta name="generator" content="Docutils 0.3.8: http://docutils.sourceforge.net/" />
@@ -169,7 +176,7 @@
<div class="section" id="building-the-graphviz-readers">
<h1><a class="toc-backref" href="#id5" name="building-the-graphviz-readers">Building the GraphViz Readers</a></h1>
<p>To use the GraphViz readers, you will need to build and link against
-the "bgl-viz" library. The library can be built by following the
+the "boost_graph" library. The library can be built by following the
<a class="reference" href="../../../more/getting_started.html#Build_Install">Boost Jam Build Instructions</a> for the subdirectory <tt class="docutils literal"><span class="pre">libs/graph/build</span></tt>.</p>
</div>
<div class="section" id="deprecated-readers">

Modified: trunk/libs/graph/doc/read_graphviz.rst
==============================================================================
--- trunk/libs/graph/doc/read_graphviz.rst (original)
+++ trunk/libs/graph/doc/read_graphviz.rst 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -6,6 +6,10 @@
:align: middle
:alt: Boost

+.. Copyright (c) 2005 Trustees of Indiana University
+ Distributed under 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)
__ ../../../index.htm

::
@@ -168,7 +172,7 @@
Building the GraphViz Readers
-----------------------------
To use the GraphViz readers, you will need to build and link against
-the "bgl-viz" library. The library can be built by following the
+the "boost_graph" library. The library can be built by following the
`Boost Jam Build Instructions`_ for the subdirectory ``libs/graph/build``.

Deprecated Readers

Modified: trunk/libs/graph/doc/reverse_graph.html
==============================================================================
--- trunk/libs/graph/doc/reverse_graph.html (original)
+++ trunk/libs/graph/doc/reverse_graph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,10 +1,10 @@
<HTML>

<Head>
<Title>Boost Graph Library: Reverse Graph Adaptor</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,5 +1,12 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
+
   <head>
     <title>Boost Graph Library: Sequential Vertex Coloring</title>
   </head>

Modified: trunk/libs/graph/doc/sloan_ordering.htm
==============================================================================
--- trunk/libs/graph/doc/sloan_ordering.htm (original)
+++ trunk/libs/graph/doc/sloan_ordering.htm 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -4,13 +4,9 @@
<META http-equiv=Content-Type content="text/html; charset=windows-1252">
<META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD>
<BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff>
@@ -91,9 +87,9 @@
   manually. But there is also an algorithm sloan_starting_nodes that provides
   usually quite good start and end vertices. Each vertex is asigned with a priority.
   This priority is a weighted sum of the distance of the vector to the end vertex
- (a global criterium) and is called the current degree of vertex. This current
+ (a global criterion) and is called the current degree of vertex. This current
   degree basically reflects the status of the renumbering in the neighborhood
- of a vertex (a local criterium). Therefore the Sloan algorithm (in contrast
+ of a vertex (a local criterion). Therefore the Sloan algorithm (in contrast
   to-McKee) takes into account local as well as global criteria for the renumbering
   sequence. One can play around with the relative weights, but the default values
   proposed by Sloan (weight1/weight2=1/2) turn out to be pretty good in most cases.

Modified: trunk/libs/graph/doc/sloan_start_end_vertices.htm
==============================================================================
--- trunk/libs/graph/doc/sloan_start_end_vertices.htm (original)
+++ trunk/libs/graph/doc/sloan_start_end_vertices.htm 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -4,13 +4,9 @@
<META http-equiv=Content-Type content="text/html; charset=windows-1252">
<META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD>
<BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff><IMG

Modified: trunk/libs/graph/doc/sparse_matrix_ordering.html
==============================================================================
--- trunk/libs/graph/doc/sparse_matrix_ordering.html (original)
+++ trunk/libs/graph/doc/sparse_matrix_ordering.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Sparse Matrix Ordering Example</Title>

Modified: trunk/libs/graph/doc/stanford_graph.html
==============================================================================
--- trunk/libs/graph/doc/stanford_graph.html (original)
+++ trunk/libs/graph/doc/stanford_graph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -3,14 +3,9 @@
   Copyright (C) 2001, Andreas Scherer, Jeremy Siek, Lie-Quan Lee,
   and Andrew Lumsdaine

- Permission to use, copy, modify, distribute and sell this software and its
- documentation for any purpose is hereby granted without fee, provided that
- the above copyright notice appears in all copies and that both that
- copyright notice and this permission notice appear in supporting
- documentation.
-
- We make no representations about the suitability of this software for any
- purpose. It is provided "as is" without express or implied warranty.
+ -- Distributed under 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)
   -->
<Head>
<Title>Boost Graph Library: Stanford Graph Interface</Title>

Modified: trunk/libs/graph/doc/strong_components.html
==============================================================================
--- trunk/libs/graph/doc/strong_components.html (original)
+++ trunk/libs/graph/doc/strong_components.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Strongly Connected Components</Title>

Modified: trunk/libs/graph/doc/subgraph.html
==============================================================================
--- trunk/libs/graph/doc/subgraph.html (original)
+++ trunk/libs/graph/doc/subgraph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Subgraph</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Table of Contents: Boost Graph Library</Title>
@@ -238,7 +234,7 @@
                 <li><a href="make_maximal_planar.html">
                 <tt>make_maximal_planar</tt></a>
                 </ol>
-
+ <li>lengauer_tarjan_dominator_tree</li>
             </OL>
          </OL>

Modified: trunk/libs/graph/doc/time_stamper.html
==============================================================================
--- trunk/libs/graph/doc/time_stamper.html (original)
+++ trunk/libs/graph/doc/time_stamper.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: time_stamper</Title>

Modified: trunk/libs/graph/doc/topological_sort.html
==============================================================================
--- trunk/libs/graph/doc/topological_sort.html (original)
+++ trunk/libs/graph/doc/topological_sort.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Topological Sort</Title>

Modified: trunk/libs/graph/doc/transitive_closure.html
==============================================================================
--- trunk/libs/graph/doc/transitive_closure.html (original)
+++ trunk/libs/graph/doc/transitive_closure.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Transitive Closure</Title>

Modified: trunk/libs/graph/doc/transpose_graph.html
==============================================================================
--- trunk/libs/graph/doc/transpose_graph.html (original)
+++ trunk/libs/graph/doc/transpose_graph.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Transpose Graph</Title>

Modified: trunk/libs/graph/doc/trouble_shooting.html
==============================================================================
--- trunk/libs/graph/doc/trouble_shooting.html (original)
+++ trunk/libs/graph/doc/trouble_shooting.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Trouble Shooting</Title>

Modified: trunk/libs/graph/doc/undirected_dfs.html
==============================================================================
--- trunk/libs/graph/doc/undirected_dfs.html (original)
+++ trunk/libs/graph/doc/undirected_dfs.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Depth-First Search</Title>

Modified: trunk/libs/graph/doc/users.html
==============================================================================
--- trunk/libs/graph/doc/users.html (original)
+++ trunk/libs/graph/doc/users.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<html>
+
<title>Boost Graph Library Users</title>
<body BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
ALINK="#ff0000">

Modified: trunk/libs/graph/doc/using_adjacency_list.html
==============================================================================
--- trunk/libs/graph/doc/using_adjacency_list.html (original)
+++ trunk/libs/graph/doc/using_adjacency_list.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Using the Boost Graph Library</Title>

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 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Using Property Maps</Title>

Modified: trunk/libs/graph/doc/visitor_concepts.html
==============================================================================
--- trunk/libs/graph/doc/visitor_concepts.html (original)
+++ trunk/libs/graph/doc/visitor_concepts.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -2,13 +2,9 @@

<Head>
<Title>Boost Graph Library: Visitor Concepts</Title>

Modified: trunk/libs/graph/doc/wavefront.htm
==============================================================================
--- trunk/libs/graph/doc/wavefront.htm (original)
+++ trunk/libs/graph/doc/wavefront.htm 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -4,13 +4,9 @@
<META http-equiv=Content-Type content="text/html; charset=windows-1252">
<META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD>
<BODY text=#000000 vLink=#551a8b aLink=#ff0000 link=#0000ee bgColor=#ffffff>

Modified: trunk/libs/graph/doc/write-graphviz.html
==============================================================================
--- trunk/libs/graph/doc/write-graphviz.html (original)
+++ trunk/libs/graph/doc/write-graphviz.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -3,13 +3,9 @@

<Head>
<Title>Boost Graph Library: write graphviz</Title>

Deleted: trunk/libs/graph/example/Jamfile
==============================================================================
--- trunk/libs/graph/example/Jamfile 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
+++ (empty file)
@@ -1,136 +0,0 @@
-subproject libs/graph/example ;
-
-# Define SGB (stanford graph base top level directory) and
-# LEDA (also top level directory) at the command line of jam using -s
-
-rule graph-test ( sources + : requirements * )
-{
- unit-test $(sources[1]:S=) : $(sources) : $(requirements) <sysinclude>$(BOOST_ROOT) : debug <inlining>on ;
-}
-
-graph-test remove_edge_if_bidir.cpp ;
-graph-test undirected_dfs.cpp ;
-graph-test remove_edge_if_dir.cpp ;
-graph-test remove_edge_if_undir.cpp ;
-graph-test reverse-graph-eg.cpp ;
-graph-test scc.cpp <lib>../build/bgl-viz ;
-graph-test strong_components.cpp <lib>../build/bgl-viz ;
-graph-test strong-components.cpp ;
-graph-test subgraph.cpp ;
-graph-test subgraph_properties.cpp ;
-graph-test topo-sort1.cpp ;
-graph-test topo-sort2.cpp ;
-graph-test topo_sort.cpp ;
-graph-test topo-sort-file-dep2.cpp ;
-graph-test topo-sort-file-dep.cpp ;
-graph-test transitive_closure.cpp ;
-graph-test transpose-example.cpp ;
-graph-test undirected.cpp ;
-graph-test vector-as-graph.cpp ;
-graph-test vertex_basics.cpp ;
-graph-test vertex-name-property.cpp ;
-graph-test visitor.cpp ;
-graph-test accum-compile-times.cpp ;
-graph-test adjacency_list.cpp ;
-graph-test adjacency_list_io.cpp ;
-graph-test adjacency_matrix.cpp ;
-graph-test bellman-example.cpp ;
-graph-test bellman-ford-internet.cpp ;
-graph-test bfs.cpp ;
-graph-test bfs-example.cpp ;
-graph-test bfs-name-printer.cpp ;
-graph-test bfs_neighbor.cpp ;
-graph-test biconnected_components.cpp ;
-graph-test boost_web_graph.cpp ;
-graph-test bucket_sorter.cpp ;
-graph-test cc-internet.cpp <lib>../build/bgl-viz ;
-graph-test city_visitor.cpp ;
-graph-test components_on_edgelist.cpp ;
-graph-test connected_components.cpp ;
-graph-test connected-components.cpp ;
-graph-test container_gen.cpp ;
-graph-test copy-example.cpp ;
-graph-test cuthill_mckee_ordering.cpp ;
-graph-test cycle-file-dep2.cpp ;
-graph-test cycle-file-dep.cpp ;
-graph-test dag_shortest_paths.cpp ;
-graph-test dave.cpp ;
-graph-test default-constructor2.cpp ;
-graph-test default-constructor.cpp ;
-graph-test dfs.cpp ;
-graph-test dfs-example.cpp ;
-graph-test dfs_parenthesis.cpp <lib>../build/bgl-viz ;
-graph-test dfs-parenthesis.cpp <lib>../build/bgl-viz ;
-graph-test dijkstra-example.cpp ;
-graph-test edge_basics.cpp ;
-graph-test edge_connectivity.cpp ;
-graph-test edge-connectivity.cpp <lib>../build/bgl-viz ;
-graph-test edge-function.cpp ;
-graph-test edge_iterator_constructor.cpp ;
-graph-test edge-iter-constructor.cpp ;
-graph-test edge_property.cpp ;
-graph-test edmunds-karp-eg.cpp ;
-graph-test exterior_properties.cpp ;
-graph-test exterior_property_map.cpp ;
-graph-test family-tree-eg.cpp ;
-graph-test fibonacci_heap.cpp ;
-graph-test file_dependencies.cpp ;
-graph-test filtered_graph.cpp ;
-graph-test filtered_vec_as_graph.cpp ;
-graph-test gerdemann.cpp ;
-graph-test graph-assoc-types.cpp ;
-graph-test graph.cpp ;
-graph-test graph-property-iter-eg.cpp ;
-graph-test graphviz.cpp <lib>../build/bgl-viz ;
-graph-test incremental_components.cpp ;
-graph-test incremental-components-eg.cpp ;
-graph-test in_edges.cpp ;
-graph-test interior_property_map.cpp ;
-graph-test isomorphism.cpp ;
-graph-test iterator-property-map-eg.cpp ;
-graph-test johnson-eg.cpp <lib>../build/bgl-viz ;
-graph-test kevin-bacon.cpp ;
-graph-test knights-tour.cpp ;
-graph-test kruskal-example.cpp ;
-graph-test kruskal-telephone.cpp <lib>../build/bgl-viz ;
-graph-test last-mod-time.cpp ;
-graph-test loops_dfs.cpp <lib>../build/bgl-viz ;
-graph-test max_flow.cpp ;
-graph-test minimum_degree_ordering.cpp iohb.c ;
-graph-test min_max_paths.cpp ;
-graph-test modify_graph.cpp ;
-graph-test neighbor_bfs.cpp ;
-graph-test ordered_out_edges.cpp ;
-graph-test ospf-example.cpp <lib>../build/bgl-viz ;
-graph-test parallel-compile-time.cpp ;
-graph-test prim-example.cpp ;
-graph-test prim-telephone.cpp <lib>../build/bgl-viz ;
-graph-test print-adjacent-vertices.cpp ;
-graph-test print-edges.cpp ;
-graph-test print-in-edges.cpp ;
-graph-test print-out-edges.cpp ;
-graph-test property_iterator.cpp ;
-graph-test property-map-traits-eg.cpp ;
-graph-test push-relabel-eg.cpp ;
-graph-test put-get-helper-eg.cpp ;
-graph-test quick_tour.cpp ;
-graph-test quick-tour.cpp ;
-graph-test reachable-loop-head.cpp <lib>../build/bgl-viz ;
-graph-test reachable-loop-tail.cpp <lib>../build/bgl-viz ;
-graph-test roget_components.cpp :
- <include>$(SGB) <library-file>$(SGB)/libgb.a ;
-graph-test topo-sort-with-leda.cpp :
- <include>$(LEDA)/incl <library-file>$(LEDA)/libG.a
- <library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a ;
-graph-test topo-sort-with-sgb.cpp :
- <include>$(SGB) <library-file>$(SGB)/libgb.a ;
-graph-test leda-concept-check.cpp :
- <include>$(LEDA)/incl <library-file>$(LEDA)/libG.a <library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a ;
-graph-test leda-graph-eg.cpp :
- <include>$(LEDA)/incl <library-file>$(LEDA)/libG.a
- <library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a ;
-graph-test girth.cpp : <include>$(SGB)
- <library-file>$(SGB)/libgb.a ;
-graph-test miles_span.cpp : <include>$(SGB)
- <library-file>$(SGB)/libgb.a ;
-

Modified: trunk/libs/graph/example/cuthill_mckee_ordering.cpp
==============================================================================
--- trunk/libs/graph/example/cuthill_mckee_ordering.cpp (original)
+++ trunk/libs/graph/example/cuthill_mckee_ordering.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -3,25 +3,9 @@
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
// Doug Gregor, D. Kevin McGrath
//
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under 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)
//=======================================================================

#include <boost/config.hpp>

Modified: trunk/libs/graph/example/data1.txt
==============================================================================
--- trunk/libs/graph/example/data1.txt (original)
+++ trunk/libs/graph/example/data1.txt 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under 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)
# five vertices
n 5
# the edges

Modified: trunk/libs/graph/example/data2.txt
==============================================================================
--- trunk/libs/graph/example/data2.txt (original)
+++ trunk/libs/graph/example/data2.txt 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under 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)
# vertices
v
0 0.5 4.1 #

Modified: trunk/libs/graph/example/data3.txt
==============================================================================
--- trunk/libs/graph/example/data3.txt (original)
+++ trunk/libs/graph/example/data3.txt 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,3 +1,8 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under 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)
# vertices and edges can be interleaved
v 3.14 0
v 3.15 1

Modified: trunk/libs/graph/example/file_dependencies.cpp
==============================================================================
--- trunk/libs/graph/example/file_dependencies.cpp (original)
+++ trunk/libs/graph/example/file_dependencies.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -6,6 +6,9 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
+
+// Some small modifications are done by Alexander Holler
+
/*

   Paul Moore's request:
@@ -14,14 +17,14 @@
   "experts", consider file dependencies. It's basically graph construction,
   plus topological sort, but it might make a nice "tutorial" example. Build a
   dependency graph of files, then use the algorithms to do things like
-
+
   1. Produce a full recompilation order (topological sort, by modified date)
   2. Produce a "parallel" recompilation order (same as above, but group files
   which can be built in parallel)
   3. Change analysis (if I change file x, which others need recompiling)
   4. Dependency changes (if I add a dependency between file x and file y, what
   are the effects)
-
+
*/

#include <boost/config.hpp> // put this first to suppress some VC++ warnings
@@ -75,7 +78,7 @@

int main(int,char*[])
{
-
+
   typedef pair<int,int> Edge;
   Edge used_by[] = {
     Edge(dax_h, foo_cpp), Edge(dax_h, bar_cpp), Edge(dax_h, yow_h),
@@ -94,79 +97,58 @@
     Edge(libzigzag_a, killerapp)
   };
   const std::size_t nedges = sizeof(used_by)/sizeof(Edge);
- int weights[nedges];
- std::fill(weights, weights + nedges, 1);

- typedef adjacency_list<vecS, vecS, directedS,
- property<vertex_color_t, default_color_type>,
- property<edge_weight_t, int>
- > Graph;
+ typedef adjacency_list<vecS, vecS, bidirectionalS> Graph;
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
   // VC++ can't handle the iterator constructor
   Graph g(N);
- property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g);
   for (std::size_t j = 0; j < nedges; ++j) {
     graph_traits<Graph>::edge_descriptor e; bool inserted;
     tie(e, inserted) = add_edge(used_by[j].first, used_by[j].second, g);
- weightmap[e] = weights[j];
   }
#else
- Graph g(used_by, used_by + nedges, weights, N);
+ Graph g(used_by, used_by + nedges, N);
#endif
   typedef graph_traits<Graph>::vertex_descriptor Vertex;

   // Determine ordering for a full recompilation
+ // and the order with files that can be compiled in parallel
   {
     typedef list<Vertex> MakeOrder;
+ MakeOrder::iterator i;
     MakeOrder make_order;
+
     topological_sort(g, std::front_inserter(make_order));
-
     cout << "make ordering: ";
- for (MakeOrder::iterator i = make_order.begin();
- i != make_order.end(); ++i)
+ for (i = make_order.begin();
+ i != make_order.end(); ++i)
       cout << name[*i] << " ";
- cout << endl;
- }
- cout << endl;
+
+ cout << endl << endl;

- // Recompilation order with files that can be compiled in parallel
- // grouped together
- {
- // Set up the necessary graph properties.
- vector<int> time(N, (std::numeric_limits<int>::max)());
- typedef vector<int>::iterator Time;
- property_map<Graph, edge_weight_t>::type weight = get(edge_weight, g);
-
- // Calculate the in_degree for each vertex.
- vector<int> in_degree(N, 0);
- graph_traits<Graph>::vertex_iterator i, iend;
- graph_traits<Graph>::out_edge_iterator j, jend;
- for (tie(i, iend) = vertices(g); i != iend; ++i)
- for (tie(j, jend) = out_edges(*i,g); j != jend; ++j)
- in_degree[target(*j,g)] += 1;
-
- std::greater<int> compare;
- closed_plus<int> combine;
-
- // Run best-first-search from each vertex with zero in-degree.
- for (tie(i, iend) = vertices(g); i != iend; ++i) {
- if (in_degree[*i] == 0) {
- std::vector<graph_traits<Graph>::vertex_descriptor>
- pred(num_vertices(g));
- property_map<Graph, vertex_index_t>::type
- indexmap = get(vertex_index, g);
- dijkstra_shortest_paths_no_init
- (g, *i, &pred[0], &time[0], weight, indexmap,
- compare, combine, 0, // Since we are using > instead of <, we
- // flip 0 and inf.
- default_dijkstra_visitor());
+ // Parallel compilation ordering
+ std::vector<int> time(N, 0);
+ for (i = make_order.begin(); i != make_order.end(); ++i) {
+ // Walk through the in_edges an calculate the maximum time.
+ if (in_degree (*i, g) > 0) {
+ Graph::in_edge_iterator j, j_end;
+ int maxdist=0;
+ // Through the order from topological sort, we are sure that every
+ // time we are using here is already initialized.
+ for (tie(j, j_end) = in_edges(*i, g); j != j_end; ++j)
+ maxdist=std::max(time[source(*j, g)], maxdist);
+ time[*i]=maxdist+1;
       }
     }

     cout << "parallel make ordering, " << endl
          << "vertices with same group number can be made in parallel" << endl;
- for (tie(i,iend) = vertices(g); i != iend; ++i)
- cout << "time_slot[" << name[*i] << "] = " << time[*i] << endl;
+ {
+ graph_traits<Graph>::vertex_iterator i, iend;
+ for (tie(i,iend) = vertices(g); i != iend; ++i)
+ cout << "time_slot[" << name[*i] << "] = " << time[*i] << endl;
+ }
+
   }
   cout << endl;

Modified: trunk/libs/graph/example/king_ordering.cpp
==============================================================================
--- trunk/libs/graph/example/king_ordering.cpp (original)
+++ trunk/libs/graph/example/king_ordering.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -3,25 +3,9 @@
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
// Doug Gregor, D. Kevin McGrath
//
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under 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)
//=======================================================================

#include <boost/config.hpp>

Modified: trunk/libs/graph/example/property_iterator.cpp
==============================================================================
--- trunk/libs/graph/example/property_iterator.cpp (original)
+++ trunk/libs/graph/example/property_iterator.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,10 +1,9 @@

-// (C) Copyright François Faure, iMAGIS-GRAVIR / UJF, 2001. Permission
-// to copy, use, modify, sell and distribute this software is granted
-// provided this copyright notice appears in all copies. This software
-// is provided "as is" without express or implied warranty, and with
-// no claim as to its suitability for any purpose.
+// (C) Copyright François Faure, iMAGIS-GRAVIR / UJF, 2001.

+// Distributed under 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)

// Revision History:
// 03 May 2001 Jeremy Siek

Deleted: trunk/libs/graph/example/regrtest.py
==============================================================================
--- trunk/libs/graph/example/regrtest.py 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
+++ (empty file)
@@ -1,306 +0,0 @@
-#!/usr/bin/python
-
-# boost graph library compilation regression test
-
-# Usage: regrtest [*|compiler] [*|library/program]
-#
-# Default: regrtest * *
-#
-# Compilers: bcc = Borland 5.5.1
-# cw = Metrowerks CodeWarrior
-# gcc = GNU GCC
-# gcc-stlport = GNU GCC with STLport library
-# como = Comeau C++
-# vc = Microsoft Visual C++
-# vcstlport = Microsoft Visual C++ with STLport library
-# suncc = Sun's C++ compiler
-# kcc = KAI C++ 3.4g
-#
-# Examples: regrtest
-# regrtest
-# regrtest gcc
-# regrtest * smart_ptr/smart_ptr_test.cpp
-# regrtest gcc smart_ptr/smart_ptr_test.cpp
-#
-# Note: use the following command line syntax if output is to be redirected:
-# python regrtest.py [*|compiler] [*|library/program] >log 2>&1
-
-# Revision history:
-# 09 Dec 00 Modified the main boost regrtest.py to create this file. -Jeremy
-
-
-# The Metrowerks and Microsoft compilers require various environment variables be set.
-# See mwcc -help
-# See http://msdn.microsoft.com/library/devprods/vs6/visualc/vccore/_core_building_on_the_command_line.3a_.overview.htm
-# Others:
-# See bcb4.hlp. Don't bother with bcb4tools.hlp; it has a bad link to the command line options
-
-import sys
-import os
-import time
-
-#------------------------------------------------------------------------------#
-
-def invoke( desc, command ):
-
- print " ", desc
- f.write( "<td>" )
- print " ", command #script debugging aid
- sys.stdout.flush()
- rs=os.system( command )
- print " return status: ", rs
- if rs==0:
- f.write( "yes" )
- else:
- f.write( "no" )
- f.write( "</td>\n" )
-
-#------------------------------------------------------------------------------#
-
-def compile( program ):
-
- fullpath= path + "/libs/" + program
-
- print
- print "*****", program, "*****"
-
- f.write( "<tr>\n" )
- f.write( "<td><a href=\"" + program + "\">" + program + "</a></td>\n" )
-
-# ---------- Linux2 ---------- #
-
- if sys.platform == "linux2":
- if compiler_arg == "*" or compiler_arg == "gcc":
- invoke( "GCC 2.95.2", 'g++ -ftemplate-depth-30 -c -I' + path + ' ' + fullpath )
- if compiler_arg == "*" or compiler_arg == "gcc-stlport":
- invoke( "GCC 2.95.2 STLport 4.0", 'g++ -V 2.95.2-stlport -c -ftemplate-depth-30 -I' + path + ' ' + fullpath )
-# if compiler_arg == "*" or compiler_arg == "gcc-exp":
-# invoke( "GCC pre-2.97 experimental", '/opt/exp/gcc/bin/g++ -ftemplate-depth-30 -I' + path + ' ' + fullpath )
- if compiler_arg == "*" or compiler_arg == "como":
- invoke( "Comeau C++ 4.2.44 beta3", 'como -c -I' + path + ' ' + fullpath)
-# if compiler_arg == "*" or compiler_arg == "occ":
-# invoke( "OpenC++ 2.5.9", 'occ -c --regular-c++ -I' + path + ' ' + fullpath)
-
-# ----------- Solaris (Sun OS 5)/Sparc ------ #
-
- elif sys.platform == "sunos5":
- if compiler_arg == "*" or compiler_arg =="suncc":
- invoke("Sun WorkShop 6 2000/04/07 C++ 5.1", 'CC -c -I' + path + ' ' + fullpath )
- if compiler_arg == "*" or compiler_arg == "gcc":
- invoke( "GCC 2.95.2", 'g++ -Wall -pedantic -ftemplate-depth-30 -Wno-long-long -c -I' + path + ' ' + fullpath )
- if compiler_arg == "*" or compiler_arg == "kcc":
- invoke( "KCC 3.4g", 'KCC --strict_warnings -lm -I' + path + ' ' + fullpath )
-
-
-# ----------- BeOS5/Intel ------ #
-#
-# currently this compiler fails so many tests that it may not be worth while
-# reporting the results: most of these are as a result of broken C++ standard
-# libraries and a non-standard <climits>, problems that the forthcoming
-# gcc3 should fix (STLPort does not build on this platform).
-#
- elif sys.platform == "beos":
- if compiler_arg=="*" or compiler_arg=="gcc":
- invoke( "GNU GCC", "c++ -ftemplate-depth-30 -Wall -I" + path + " " + fullpath )
- if compiler_arg=="*" or compiler_arg=="gcc-sgi":
- invoke( "GNU GCC", "c++ -ftemplate-depth-30 -Wall -I/boot/home/config/stlport/stl330 -I" + path + " " + fullpath )
-
-# ---------- Windows ---------- #
-
- else:
-# if compiler_arg=="*" or compiler_arg=="bcc54":
-# bcc54_path=os.environ["BOOST_BCC54_PATH"]
-# invoke( "Borland C++ 5.4 up2", "\"" + bcc54_path + "/bcc32\" -I" + path + " -j10 -q " + fullpath )
- if compiler_arg=="*" or compiler_arg=="bcc":
- bcc55_path=os.environ["BOOST_BCC55_PATH"]
- invoke( "Borland C++ 5.5.1", "\"" + bcc55_path + "/bcc32\" -I" + path + " -j10 -q " + fullpath )
-
- # GCC 2.95.2 is looping on some tests, so only invoke if asked for by name
- #if compiler_arg=="*" or compiler_arg=="gcc":
- if compiler_arg=="gcc":
- # TODO: fix the absolute STLport paths
- invoke( "GNU GCC", "c++ -ftemplate-depth-30 -I" + path + " -IC:/stl/STLport-4.0b8/stlport " + fullpath + " c:/stl/STLport-4.0b8/lib/libstlport_gcc.a" )
-
- if compiler_arg=="*" or compiler_arg=="cw":
- invoke( "Metrowerks CodeWarrior", "mwcc -maxerrors 10 -cwd source -I- -I" + path + " " + fullpath )
-
-#John Maddock says use /Zm400 switch; it increases compiler memory
-# /MDd causes compiler errors in VC98\INCLUDE\xlocnum -Jeremy Siek
- if compiler_arg=="*" or compiler_arg=="vc":
- invoke( "VC++ with MS library", 'cl /c /nologo /Zm400 /W3 /GR /GX /Zi /Od /GZ /I "' + path + '" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_CONSOLE" ' + fullpath )
- if compiler_arg=="*" or compiler_arg=="vcstlport":
- stl=os.environ["BOOST_STLPORT_PATH"]
- invoke( "VC++ with STLport library", 'cl /c /nologo /Zm400 /W3 /GR /GX /Zi /Od /GZ /I "' + stl + '" /I "' + path + '" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_CONSOLE" ' + fullpath )
-
-
- f.write( "</tr>\n" )
-
-#------------------------------------------------------------------------------#
-
-def library():
-
- print
- print "***** Boost Library *****"
-
- f.write( "<tr>\n" )
- f.write( "<td>Boost Graph Library build</td>\n" )
-
- #if compiler_arg=="*" or compiler_arg=="bcc32":
- #if compiler_arg=="*" or compiler_arg=="gcc":
- #if compiler_arg=="*" or compiler_arg=="cw":
-
- #if compiler_arg=="*" or compiler_arg=="vc":
- # command='cl /nologo /MDd /W3 /GR /GX /Zi /Od /GZ /I "' + path + '" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB /c"'
- # command=command + " " + path + "/libs/" + ...
- # invoke( "VC++ with MS library", command )
-
-# invoke( "MS Lib with MS library", 'lib /nologo /out:"boost_vc.lib" boost_timer_vc.obj boost_prg_timer_vc.obj boost_prg_display_vc.obj' )
-
- #if compiler_arg=="*" or compiler_arg=="vcstlport":
-
- f.write( "</tr>\n" )
-
-#---------------------------------- main ------------------------------------#
-
-# set up environment variables
-
-path=os.environ["BOOST_PATH"]
-
-compiler_arg="*"
-if len(sys.argv)>1:
- compiler_arg=sys.argv[1]
-
-program_arg="*"
-if len(sys.argv)>2:
- program_arg=sys.argv[2]
-
-if sys.platform == "linux2":
- platform = "Linux/x86"
-elif sys.platform == "sunos5":
- platform = "SunOS5/sparc"
-elif sys.platform == "beos":
- platform = "BeOS5/x86"
-elif sys.platform == "win32":
- platform = "Windows"
- if os.name == "nt":
- platform = platform + " NT / Windows 2000"
-else:
- print "**** Error: unknown platform ****"
- sys.exit(1)
-
-f=open( "cs-" + sys.platform + ".html", "w" )
-
-f.write( "<html>\n<head>\n<title>\nCompiler Status: " + platform + "\n</title>\n</head>" )
-f.write( "<body bgcolor=\"#FFFFFF\" text=\"#000000\">\n" )
-f.write( "<h1><img border=\"0\" src=\"../../../boost.png\" width=\"277\" height=\"86\"></h1>\n" )
-f.write( "<h1>Compiler Status: " + platform + "</h1>\n" )
-f.write( "<p><b>Run Date:</b> " + time.strftime("%d %b %Y %H:%M GMT", time.gmtime(time.time())) + "</p>\n" )
-f.write( "<p>\n" )
-f.write( "<table border=\"1\" cellspacing=\"0\" cellpadding=\"5\">\n" )
-f.write( "<tr>\n" )
-f.write( "<td>Program</td>\n" )
-
-if sys.platform == "linux2":
- if compiler_arg == "*" or compiler_arg == "gcc":
- f.write( "<td>GNU<br>GCC<br>2.95.2</td>\n" )
- if compiler_arg == "*" or compiler_arg == "gcc-stlport":
- f.write( "<td>GNU<br>GCC<br>2.95.2<br>STLport<br>4.0</td>\n" )
-# if compiler_arg == "*" or compiler_arg == "gcc-exp":
-# f.write( "<td>GNU<br>GCC<br>pre-2.97 experimental</td>\n" )
- if compiler_arg == "*" or compiler_arg == "como":
- f.write( "<td>Comeau C++<br>4.2.44 beta3<br>STLport<br>4.0</td>\n" )
-# if compiler_arg == "*" or compiler_arg == "occ":
-# f.write( "<td>OpenC++<br>2.5.9</td>\n" )
-elif sys.platform == "sunos5":
- if compiler_arg == "*" or compiler_arg == "suncc":
- f.write( "<td>Sun C++<br>Sun WorkShop 6, C++ 5.1</td>\n" )
- if compiler_arg == "*" or compiler_arg == "gcc":
- f.write( "<td>GNU<br>GCC<br>2.95.2</td>\n" )
- if compiler_arg == "*" or compiler_arg == "kcc":
- f.write( "<td>KAI<br>KCC<br>3.4g</td>\n" )
-elif sys.platform == "beos":
- if compiler_arg == "*" or compiler_arg == "gcc":
- f.write( "<td>GNUPro<br>GCC 2.9</td>\n" )
- if compiler_arg == "*" or compiler_arg == "gcc-sgi":
- f.write( "<td>GNUPro<br>GCC 2.9<br>+<br>SGI STL 3.3</td>\n" )
-else:
-# if compiler_arg=="*" or compiler_arg=="bcc54":
-# f.write( "<td>Borland<br>BCC<br>5.4 up2</td>\n" )
- if compiler_arg=="*" or compiler_arg=="bcc":
- f.write( "<td>Borland<br>BCC<br>5.5.1</td>\n" )
-
- # GCC 2.95.2 is looping on some tests, so only invoke if asked for by name
- #if compiler_arg=="*" or compiler_arg=="gcc":
- if compiler_arg=="gcc":
- f.write( "<td>GNU<br>GCC<br>2.95.2<br>STLport<br>4.0 beta 8</td>\n" )
- if compiler_arg=="*" or compiler_arg=="cw":
- f.write( "<td>Metrowerks<br>CodeWarrior<br>6.0</td>\n" )
- if compiler_arg=="*" or compiler_arg=="vc":
- f.write( "<td>Microsoft<br>VC++<br>6.0 SP4</td>\n" )
- if compiler_arg=="*" or compiler_arg=="vcstlport":
- f.write( "<td>Microsoft<br>VC++<br>6.0 SP4<br>STLport<br>4.0</td>\n" )
-
-f.write( "</tr>\n" )
-
-if program_arg=="*":
-# compile( "graph/example/LEDA_concept_check.cpp" )
- compile( "graph/example/adjacency_list.cpp" )
- compile( "graph/example/bellman_ford.cpp" )
- compile( "graph/example/bfs.cpp" )
- compile( "graph/example/bfs_basics.cpp" )
- compile( "graph/example/bucket_sorter.cpp" )
- compile( "graph/example/city_visitor.cpp" )
- compile( "graph/example/components_on_edgelist.cpp" )
- compile( "graph/example/concept_checks.cpp" )
- compile( "graph/example/connected_components.cpp" )
- compile( "graph/example/container_gen.cpp" )
- compile( "graph/example/cuthill_mckee_ordering.cpp" )
- compile( "graph/example/dave.cpp" )
- compile( "graph/example/dfs.cpp" )
- compile( "graph/example/dfs_basics.cpp" )
- compile( "graph/example/dfs_parenthesis.cpp" )
- compile( "graph/example/dijkstra.cpp" )
- compile( "graph/example/dynamic_components.cpp" )
- compile( "graph/example/edge_basics.cpp" )
- compile( "graph/example/edge_iterator_constructor.cpp" )
- compile( "graph/example/edge_property.cpp" )
- compile( "graph/example/exterior_properties.cpp" )
- compile( "graph/example/exterior_property_map.cpp" )
- compile( "graph/example/family_tree.cpp" )
- compile( "graph/example/fibonacci_heap.cpp" )
- compile( "graph/example/file_dependencies.cpp" )
- compile( "graph/example/gerdemann.cpp" )
- compile( "graph/example/graph.cpp" )
- compile( "graph/example/in_edges.cpp" )
- compile( "graph/example/interior_property_map.cpp" )
- compile( "graph/example/johnson.cpp" )
- compile( "graph/example/kevin_bacon.cpp" )
- compile( "graph/example/knights_tour.cpp" )
- compile( "graph/example/kruskal.cpp" )
- compile( "graph/example/max_flow.cpp" )
-# compile( "graph/example/miles_span.cpp" )
- compile( "graph/example/ordered_out_edges.cpp" )
- compile( "graph/example/prim.cpp" )
- compile( "graph/example/quick_tour.cpp" )
- compile( "graph/example/remove_edge_if_bidir.cpp" )
- compile( "graph/example/remove_edge_if_dir.cpp" )
- compile( "graph/example/remove_edge_if_undir.cpp" )
- compile( "graph/example/reverse_graph.cpp" )
- compile( "graph/example/topo_sort.cpp" )
- compile( "graph/example/undirected.cpp" )
- compile( "graph/example/vector_as_graph.cpp" )
- compile( "graph/example/vertex_basics.cpp" )
- compile( "graph/example/visitor.cpp" )
-else:
- compile( program_arg )
-
-f.write( "</table>\n" );
-if sys.platform == "linux2":
- f.write( "<p>\nNote: A hand-crafted <limits> Standard header has been applied to all configurations.\n" )
-f.write( "</body>\n</html>\n" )
-
-# end
-
-
-
-

Modified: trunk/libs/graph/example/sloan_ordering.cpp
==============================================================================
--- trunk/libs/graph/example/sloan_ordering.cpp (original)
+++ trunk/libs/graph/example/sloan_ordering.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -3,25 +3,9 @@
// Copyright 2002 Marc Wintermantel (wintermantel_at_[hidden])
// ETH Zurich, Center of Structure Technologies (www.imes.ethz.ch/st)
//
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under 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)
//=======================================================================
//

Modified: trunk/libs/graph/index.html
==============================================================================
--- trunk/libs/graph/index.html (original)
+++ trunk/libs/graph/index.html 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,4 +1,11 @@
<html>
+
<head>
<meta http-equiv="refresh" content="0; URL=doc/index.html">
</head>

Modified: trunk/libs/graph/test/Jamfile.v2
==============================================================================
--- trunk/libs/graph/test/Jamfile.v2 (original)
+++ trunk/libs/graph/test/Jamfile.v2 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,3 +1,9 @@
+# Copyright (c) 2002 Trustees of Indiana University
+#
+# Distributed under 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)
+
# Define SGB (stanford graph base top level directory) and
# LEDA (also top level directory) at the command line of jam using -s

Modified: trunk/libs/graph/test/bidir_remove_edge.cpp
==============================================================================
--- trunk/libs/graph/test/bidir_remove_edge.cpp (original)
+++ trunk/libs/graph/test/bidir_remove_edge.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -13,7 +13,7 @@
};

int
-main()
+main(int, char*[])
{
{
typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS,

Modified: trunk/libs/graph/test/cuthill_mckee_ordering.cpp
==============================================================================
--- trunk/libs/graph/test/cuthill_mckee_ordering.cpp (original)
+++ trunk/libs/graph/test/cuthill_mckee_ordering.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -3,25 +3,9 @@
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
// Doug Gregor, D. Kevin McGrath
//
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under 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)
//=======================================================================

#include <boost/config.hpp>

Modified: trunk/libs/graph/test/dag_longest_paths.cpp
==============================================================================
--- trunk/libs/graph/test/dag_longest_paths.cpp (original)
+++ trunk/libs/graph/test/dag_longest_paths.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,3 +1,8 @@
+// Copyright (C) 2002 Trustees of Indiana University
+
+// Distributed under 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)

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dag_shortest_paths.hpp>

Modified: trunk/libs/graph/test/dijkstra_heap_performance.cpp
==============================================================================
--- trunk/libs/graph/test/dijkstra_heap_performance.cpp (original)
+++ trunk/libs/graph/test/dijkstra_heap_performance.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -11,7 +11,6 @@
#endif

#include <boost/graph/dijkstra_shortest_paths.hpp>
-#include <boost/test/minimal.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/random/linear_congruential.hpp>
#include <boost/lexical_cast.hpp>
@@ -81,7 +80,7 @@
}
#endif

-int test_main(int argc, char* argv[])
+int main(int argc, char* argv[])
{
   unsigned n = (argc > 1? lexical_cast<unsigned>(argv[1]) : 10000u);
   unsigned m = (argc > 2? lexical_cast<unsigned>(argv[2]) : 10*n);
@@ -136,7 +135,7 @@
             << "Speedup = " << (binary_heap_time / relaxed_heap_time) << ".\n";

   // Verify that the results are equivalent
- BOOST_CHECK(binary_heap_distances == relaxed_heap_distances);
+ BOOST_TEST(binary_heap_distances == relaxed_heap_distances);

#ifdef BOOST_GRAPH_DIJKSTRA_TESTING_DIETMAR
   run_test(g, "d-ary heap (d=2)", dijkstra_d_heap_2, binary_heap_distances);

Modified: trunk/libs/graph/test/dominator_tree_test.cpp
==============================================================================
--- trunk/libs/graph/test/dominator_tree_test.cpp (original)
+++ trunk/libs/graph/test/dominator_tree_test.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -25,10 +25,10 @@
using namespace boost;

typedef adjacency_list<
- listS,
- listS,
- bidirectionalS,
- property<vertex_index_t, std::size_t>, no_property> G;
+ listS,
+ listS,
+ bidirectionalS,
+ property<vertex_index_t, std::size_t>, no_property> G;

int test_main(int, char*[])
{

Modified: trunk/libs/graph/test/king_ordering.cpp
==============================================================================
--- trunk/libs/graph/test/king_ordering.cpp (original)
+++ trunk/libs/graph/test/king_ordering.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -3,25 +3,9 @@
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
// Doug Gregor, D. Kevin McGrath
//
-// This file is part of the Boost Graph Library
-//
-// You should have received a copy of the License Agreement for the
-// Boost Graph Library along with the software; see the file LICENSE.
-// If not, contact Office of Research, University of Notre Dame, Notre
-// Dame, IN 46556.
-//
-// Permission to modify the code and to distribute modified code is
-// granted, provided the text of this NOTICE is retained, a notice that
-// the code was modified is included with the above COPYRIGHT NOTICE and
-// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
-// file is distributed with the modified code.
-//
-// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
-// By way of example, but not limitation, Licensor MAKES NO
-// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
-// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
-// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
-// OR OTHER RIGHTS.
+// Distributed under 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)
//=======================================================================

#include <boost/config.hpp>

Modified: trunk/libs/graph/test/serialize.cpp
==============================================================================
--- trunk/libs/graph/test/serialize.cpp (original)
+++ trunk/libs/graph/test/serialize.cpp 2007-11-05 16:43:24 EST (Mon, 05 Nov 2007)
@@ -1,3 +1,9 @@
+// Copyright (C) 2006 Trustees of Indiana University
+//
+// Distributed under 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)
+
#include <boost/config.hpp>
#include <iostream>
#include <fstream>

Next message: eric_at_[hidden]: "[Boost-commit] svn:boost r40814 - branches/proto/v3"
Previous message: dgregor_at_[hidden]: "[Boost-commit] svn:boost r40812 - in trunk/libs/graph: build/python example/python src/python test/python"

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