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

Subject: [Boost-bugs] [Boost C++ Libraries] #6780: [BGL] add Maximum Adjacency Search
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2012-04-11 02:14:12

#6780: [BGL] add Maximum Adjacency Search
------------------------------+---------------------------------------------
 Reporter:  fvilas@…          |        Type:  Patches                     
   Status:  new               |   Milestone:  To Be Determined            
Component:  None              |     Version:  Boost 1.48.0                
 Severity:  Problem           |    Keywords:  BGL Maximum Adjacency Search
------------------------------+---------------------------------------------
 Currently, the maximum adjacency search (MAS) algorithm is embedded as a
 phase of the Stoer-Wagner min-cut algorithm. This patch promotes it to be
 a public search algorithm with a visitor concept similar to BFS or DFS.
 The existing Stoer-Wagner implementation is modified to use the MAS. The
 patch also includes HTML documentation of MAS.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/6780>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.