|
Boost : |
Subject: Re: [boost] space complexity of push_relabel_max_flow
From: Tim Keitt (tkeitt_at_[hidden])
Date: 2010-04-15 12:03:49
On Thu, Apr 15, 2010 at 10:53 AM, Jeremiah Willcock <jewillco_at_[hidden]> wrote:
> On Thu, 15 Apr 2010, Tim Keitt wrote:
>
> (snip)
>
>> Dear Dan,
>>
>> I have implemented a set of prototype graph classes that use
>> PostgreSQL to store edge lists. The graph classes do not store data,
>> only prepared queries. The code is at
>> https://code.launchpad.net/postgraph
>>
>> I would actually love some help with this code. Implementing your own
>> graph classes in the BGL is I found non-trivial. I never got
>> push-relabel max-flow to compile with my classes. I probably need to
>> implement concept checking. Unfortunately, I've largely run out of
>> time to work on this. If anyone is interested in the code, I will be
>> happy to assist their efforts in anyway I can.
>
> Is there a particular test program that you have that doesn't compile? I
> can probably take a look at it and see what the issue is.
OK. 30 pages of gcc template errors coming your way... he he
Seriously, though _thanks_ for the offer. I'll see if I can find a
moment to reconstruct the error.
Cheers,
Tim
>
> -- Jeremiah Willcock
> _______________________________________________
> Unsubscribe & other changes:
> http://lists.boost.org/mailman/listinfo.cgi/boost
>
-- Timothy H. Keitt http://www.keittlab.org/
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk