Subject: Re: [boost] [BGL] StoerâWagner min-cut algorithm
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-07-12 12:08:20
On Fri, 9 Jul 2010, Daniel Trebbien wrote:
> I uploaded an ever-so-slightly-different new release:
> 1. Switched the example program, `stoer_wagner.cpp`, to using
> 2. Documented the case when `stoer_wagner_min_cut` can throw a
> `std::invalid_argument` object.
> 3. Slightly re-formatted the whitespace in
Actually, your graphs appear to be in DIMACS format
(<URL:ftp://dimacs.rutgers.edu/pub/netflow/>, see general-info/specs.tex
in there for the file format). BGL already has a reader for some variant
of that format, and it appears to handle "a" lines; could you please try
to use/update that for your tests?
-- Jeremiah Willcock
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk