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-04-22 06:49:53

#8433: Algorithm for finding all the elementary circuits in a directed
(multi)graph
-------------------------+-------------------------------------------------
  Reporter:  Louis       |      Owner:  jewillco
  Dionne                 |     Status:  reopened
      Type:  Library     |  Component:  xpressive
  Submissions            |   Severity:  Not Applicable
 Milestone:  Website     |   Keywords:  graph multigraph circuit cycle
  1.X                    |  hawick
   Version:              |
  Boost.Build-M3         |
Resolution:              |
-------------------------+-------------------------------------------------
Changes (by Smithe854):

 * status:  closed => reopened
 * type:  Feature Requests => Library Submissions
 * component:  graph => xpressive
 * version:  Boost 1.54.0 => Boost.Build-M3
 * milestone:  To Be Determined => Website 1.X
 * resolution:  fixed =>

Comment:

 I'm truly enjoying the design and layout of your blog. It's a very easy on
 the eyes which makes it much more pleasant for me to come here and visit
 more often. Did you hire out a developer to create your theme? Outstanding
 work! effckkaddggaecee

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