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.