Re: [Boost-bugs] [Boost C++ Libraries] #6780: [BGL] add Maximum Adjacency Search

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #6780: [BGL] add Maximum Adjacency Search
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2012-12-07 22:38:21

#6780: [BGL] add Maximum Adjacency Search
  Reporter: fvilas@… | Owner: jewillco
      Type: Patches | Status: new
 Milestone: To Be Determined | Component: graph
   Version: Boost 1.48.0 | Severity: Problem
Resolution: | Keywords: BGL Maximum Adjacency Search

Comment (by fvilas@…):

 I incorporated your changes and added the include for
 one_bit_color_map.hpp. Then I made this patch, got a clean copy of the
 code from SVN and applied the patch to the new code. The normal
 " ; b2 ; cd libs/graph/example ; ../../../b2" seemed to work. I
 ran the resulting code for Stoer-Wagner and it worked. This was using GCC
 4.7.1 with the default settings from bjam.

 I have thought about changing the graph used in the test case to match the
 picture in the documentation, but the result should still be correct for
 the graph tested.

Ticket URL: <>
Boost C++ Libraries <>
Boost provides free peer-reviewed portable C++ source libraries.

This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:11 UTC