[Boost-commit] svn:boost r56563 - in trunk/libs/graph: doc quickbook/guide

Subject: [Boost-commit] svn:boost r56563 - in trunk/libs/graph: doc quickbook/guide
From: jewillco_at_[hidden]
Date: 2009-10-03 21:48:17

Author: jewillco
Date: 2009-10-03 21:48:16 EDT (Sat, 03 Oct 2009)
New Revision: 56563
URL: http://svn.boost.org/trac/boost/changeset/56563

Log:
Changed from Vertex() to null_vertex() in examples; refs #3506
Text files modified: 
   trunk/libs/graph/doc/quick_tour.html      |     4 ++--                                    
   trunk/libs/graph/quickbook/guide/tour.qbk |     6 +++---                                  
   2 files changed, 5 insertions(+), 5 deletions(-)

Modified: trunk/libs/graph/doc/quick_tour.html
==============================================================================
--- trunk/libs/graph/doc/quick_tour.html	(original)
+++ trunk/libs/graph/doc/quick_tour.html	2009-10-03 21:48:16 EDT (Sat, 03 Oct 2009)
@@ -557,14 +557,14 @@
   using std::vector;
   using std::cout;
   using std::endl;
-  vector<Vertex> p(num_vertices(G)); //the predecessor array
+  vector<Vertex> p(num_vertices(G), graph_traits<G>::null_vertex()); //the predecessor array
   dijkstra_shortest_paths(G, s, distance_map(&d[0]). 
                           visitor(make_predecessor_recorder(&p[0])));
 
   cout << "parents in the tree of shortest paths:" << endl;
   for(vi = vertices(G).first; vi != vertices(G).second; ++vi) {
     cout << "parent(" << *vi;
-    if (p[*vi] == Vertex())
+    if (p[*vi] == graph_traits<G>::null_vertex())
       cout << ") = no parent" << endl; 
     else 
       cout << ") = " << p[*vi] << endl;

Modified: trunk/libs/graph/quickbook/guide/tour.qbk
==============================================================================
--- trunk/libs/graph/quickbook/guide/tour.qbk	(original)
+++ trunk/libs/graph/quickbook/guide/tour.qbk	2009-10-03 21:48:16 EDT (Sat, 03 Oct 2009)
@@ -525,14 +525,14 @@
  using std::vector;
  using std::cout;
  using std::endl;
- vector<Vertex> p(num_vertices(G)); //the predecessor array
+ vector<Vertex> p(num_vertices(G), graph_traits<G>::null_vertex()); //the predecessor array
  dijkstra_shortest_paths(G, s, distance_map(&d[0]).
                          visitor(make_predecessor_recorder(&p[0])));
 
  cout << "parents in the tree of shortest paths:" << endl;
  for(vi = vertices(G).first; vi != vertices(G).second; ++vi) {
    cout << "parent(" << *vi;
-   if (p[*vi] == Vertex())
+   if (p[*vi] == graph_traits<G>::null_vertex())
      cout << ") = no parent" << endl;
    else
      cout << ") = " << p[*vi] << endl;
@@ -548,4 +548,4 @@
  parent(4) = 3
 ]
 
-[endsect]
\ No newline at end of file
+[endsect]