Hello, everybody

I know the method to find the minimum cost maximum flow in a directed grapth.

But how to find

MinCost MaxFlow with an "Undirected" Graph ?

I also see the online judge problem "10594 DataFlow"

the graph in that problem also is undirected.

( I need a simple algorithm , not too difficult. )

Thanks in advance.

## MinCost MaxFlow with [Undirected Graph]

**Moderator:** Board moderators

### Re: MinCost MaxFlow with [Undirected Graph]

Simply replace each undirected edge by a pair of directed edges, each of them having the same capacity and length/cost.hank wrote:Hello, everybody

I know the method to find the minimum cost maximum flow in a directed grapth.

But how to find

MinCost MaxFlow with an "Undirected" Graph ?

I also see the online judge problem "10594 DataFlow"

the graph in that problem also is undirected.

( I need a simple algorithm , not too difficult. )

Thanks in advance.