Re: [Boost-bugs] [Boost C++ Libraries] #8433: Algorithm for finding all the elementary circuits in a directed (multi)graph

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #8433: Algorithm for finding all the elementary circuits in a directed (multi)graph
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2015-11-13 17:09:15

#8433: Algorithm for finding all the elementary circuits in a directed
(multi)graph
-------------------------+-------------------------------------------------
  Reporter:  Louis       |      Owner:  jewillco
  Dionne                 |     Status:  reopened
      Type:  Feature     |  Component:  graph
  Requests               |   Severity:  Not Applicable
 Milestone:  To Be       |   Keywords:  graph multigraph circuit cycle
  Determined             |  hawick
   Version:  Boost       |
  1.53.0                 |
Resolution:              |
-------------------------+-------------------------------------------------
Changes (by ldionne.2@…):

 * type:  Library Submissions => Feature Requests
 * version:  Boost.Build-M3 => Boost 1.53.0
 * component:  xpressive => graph
 * milestone:  Website 1.X => To Be Determined

Comment:

 Damn bot. We should be good to close this once
 https://github.com/boostorg/graph/pull/50 is merged.

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