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: Michele Caini (michele.caini_at_[hidden])
Date: 2010-02-15 10:20:47

Il 03/02/2010 19:48, Jeremiah Willcock ha scritto:
> On Sun, 31 Jan 2010, Michele Caini wrote:
> 
>> [...]
>>
>> 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.
>>
>> [...]
>> 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.
> [...]
> 
> -- Jeremiah Willcock

Hi, Jeremiah.
I'm also developing the old alternative, the grimbleby version of the
algorithm, so we'll can propose all of them (for comparision, of course).

I'll write on boost developers list as soon as the algorithms will be
developed, don't worry about.

Thanks a lot,
Michele