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: 2013-08-31 19:29:23

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

 * status:  new => closed
 * resolution:   => fixed

Comment:

 (In [85533]) Added Hawick circuits code from Louis Dionne; fixes #8433

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