Re: [boost] CSR graph in max flow

Subject: Re: [boost] CSR graph in max flow
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-04-15 11:48:53

On Thu, 15 Apr 2010, Dan Jiang wrote:

> Hi All, I have a question regarding CSR graph. Does anyone know if a CSR 
> graph can be used as input to push_relabel_max_flow or 
> edmonds_karp_max_flow algorithm in BOOST? The existing examples only use 
> adjacency_list with the maximum flow algorithms. I need to use CSR graph 
> with the max flow implementations, but do not know how and if it is 
> feasible at all. If answer is yes, can anyone give a simple example? I 
> am having trouble in setting capacity map and reverse_edge map in CSR 
> before passing it to the max flow algorithms. -Thanks a lot for your 
> time. Dan Jiang

Are there any issues you're having now that are not addressed by my 
previous email?  These algorithms should work with CSR graphs; the 
property maps need to be changed to be bundled properties, though, and so 
the access method to get them differs from the adjacency_list version.

-- Jeremiah Willcock