|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r83832 - in trunk: boost/graph libs/graph/doc libs/graph/test
From: jewillco_at_[hidden]
Date: 2013-04-10 13:03:22
Author: jewillco
Date: 2013-04-10 13:03:21 EDT (Wed, 10 Apr 2013)
New Revision: 83832
URL: http://svn.boost.org/trac/boost/changeset/83832
Log:
Added patches from Flavio De Lorenzi; fixed HTML typo in VF2 documentation
Text files modified:
trunk/boost/graph/vf2_sub_graph_iso.hpp | 5 ++++-
trunk/libs/graph/doc/vf2_sub_graph_iso.html | 2 +-
trunk/libs/graph/test/vf2_sub_graph_iso_test.cpp | 5 ++++-
3 files changed, 9 insertions(+), 3 deletions(-)
Modified: trunk/boost/graph/vf2_sub_graph_iso.hpp
==============================================================================
--- trunk/boost/graph/vf2_sub_graph_iso.hpp (original)
+++ trunk/boost/graph/vf2_sub_graph_iso.hpp 2013-04-10 13:03:21 EDT (Wed, 10 Apr 2013)
@@ -11,6 +11,9 @@
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
+// Revision History:
+// 8 April 2013: Fixed a typo in vf2_print_callback. (Flavio De Lorenzi)
+
#ifndef BOOST_VF2_SUB_GRAPH_ISO_HPP
#define BOOST_VF2_SUB_GRAPH_ISO_HPP
@@ -55,7 +58,7 @@
// Print (sub)graph isomorphism map
BGL_FORALL_VERTICES_T(v, graph1_, Graph1)
std::cout << '(' << get(vertex_index_t(), graph1_, v) << ", "
- << get(vertex_index_t(), graph1_, get(f, v)) << ") ";
+ << get(vertex_index_t(), graph2_, get(f, v)) << ") ";
std::cout << std::endl;
Modified: trunk/libs/graph/doc/vf2_sub_graph_iso.html
==============================================================================
--- trunk/libs/graph/doc/vf2_sub_graph_iso.html (original)
+++ trunk/libs/graph/doc/vf2_sub_graph_iso.html 2013-04-10 13:03:21 EDT (Wed, 10 Apr 2013)
@@ -87,7 +87,7 @@
graph that preserves the edge structure of the graphs. <em>M</em> is said to be a
graph-subgraph isomorphism if and only if <em>M</em> is an isomorphism between
<em>G<sub>1</sub></em> and a subgraph of <em>G<sub>2</sub></em>.
- An induced subgraph of a graph <em>G = (V, E)<em> is a normal subgraph
+ An induced subgraph of a graph <em>G = (V, E)</em> is a normal subgraph
<em>G' = (V', E')</em> with the extra condition that all edges of <em>G</em>
which have both endpoints in <em>V'</em> are in <em>E'</em>.
</p>
Modified: trunk/libs/graph/test/vf2_sub_graph_iso_test.cpp
==============================================================================
--- trunk/libs/graph/test/vf2_sub_graph_iso_test.cpp (original)
+++ trunk/libs/graph/test/vf2_sub_graph_iso_test.cpp 2013-04-10 13:03:21 EDT (Wed, 10 Apr 2013)
@@ -9,6 +9,9 @@
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
+// Revision History:
+// 8 April 2013: Fixed a typo in random_functor. (Flavio De Lorenzi)
+
#include <iostream>
#include <fstream>
#include <map>
@@ -36,7 +39,7 @@
random_functor(Generator& g) : g(g) { }
std::size_t operator()(std::size_t n) {
boost::uniform_int<std::size_t> distrib(0, n-1);
- boost::variate_generator<boost::mt19937&, boost::uniform_int<std::size_t> >
+ boost::variate_generator<Generator&, boost::uniform_int<std::size_t> >
x(g, distrib);
return x();
}
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