Subject: Re: [boost] [BGL] StoerâWagner min-cut algorithm
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-07-05 10:47:30
On Mon, 5 Jul 2010, Daniel Trebbien wrote:
>> I'm fine with making the heap an optional parameter, but not
>> the underlying storage.
> Is there work on creating a concept for a heap?
Yes -- look at
the basic queue concept. If you need updating, there does not appear to
be a defined concept for that, but you should use the interface that
dijkstra_shortest_paths() uses for its queue.
-- Jeremiah Willcock
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk