Subject: [Boost-bugs] [Boost C++ Libraries] #6401: BGL: new algorithm
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2012-01-15 21:38:48
#6401: BGL: new algorithm
-------------------------------------+--------------------------------------
Reporter: michele.caini@⦠| Type: Library Submissions
Status: new | Milestone: To Be Determined
Component: None | Version: Boost Development Trunk
Severity: Not Applicable | Keywords: bgl, mrt
-------------------------------------+--------------------------------------
I would like to submit a new algorithm for inclusion in the Boost Graph
Library.
It can be used to search the common spanning trees of two graphs, assuming
that the graphs are represented as lists of edges. More details if you are
interested.
It is currently used within the software QSapecNG
(https://sourceforge.net/projects/qsapecng/).
I request to know what is required for submission in support of the
algorithm.
Thanks,
Michele
-- Ticket URL: <https://svn.boost.org/trac/boost/ticket/6401> Boost C++ Libraries <http://www.boost.org/> Boost provides free peer-reviewed portable C++ source libraries.
This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:08 UTC