Re: [Boost-users] [Boost Graph] Two-graphs common spanning tree problem: generic algorithm (with concept checking, of course)

Subject: Re: [Boost-users] [Boost Graph] Two-graphs common spanning tree problem: generic algorithm (with concept checking, of course)
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-02-03 13:48:27

On Sun, 31 Jan 2010, Michele Caini wrote:

> Hi all,
> my name is Michele Caini, I write from Italy, Florence, and this is my
> first mail on this list.
>
> I'd like to propose a new generic implementation of the two-graphs
> common three algorithm, proposed first by Grimbleby and then modified by
> Schach, that made a revolution on the first idea basing his algorithm on
> the solution for the single spanning three problem proposed and
> developed by Mint, Read and Tarjan.
>
> This algorithm is mainly used in symbolic circuit analysis, and I
> develop a generic solution for my symbolic solutor: QSapecNG, Qt-based
> frontend for symbolic circuit solution.
> If Boost Graph library mantainers are interested on publishing this
> algorithm with the next release of library, I'm happy to submit it, and
> to work on to optimize the code.

We are always interested in new algorithms for BGL.  The code would need 
to be changed to be as generic as possible and Boost-compliant in naming 
conventions and such, but I can make suggestions and review code for that. 
You would need to have the code available under the Boost Software License 
to put it into BGL.  If you have that, please attach the right copyright 
and license statements to your code and send it to the mailing list (I 
think actually the Boost developer list <boost_at_[hidden]> rather 
than boost-users).  Thank you for your offer.

-- Jeremiah Willcock