Find Maximum Flow for graph with infinite capacities

[Dav]

I want to know how I could compute maximum flow for a graph G(V,E) that includes one or more infinite capacities.

Thanks

[Larz60+]

Perhaps:
NetworkX is a Python language software package for the creation, manipulation, and study of the structure, dynamics, and function of complex networks
https://networkx.github.io/documentation/networkx-1.10/

Maximum Flow:
https://networkx.github.io/documentation...value.html

[Dav]

Perhaps:
NetworkX is a Python language software package for the creation, manipulation, and study of the structure, dynamics, and function of complex networks
https://networkx.github.io/documentation/networkx-1.10/

Maximum Flow:
https://networkx.github.io/documentation...value.html

Thank you

I already use networkx for any graph manipulation but it does not support infinite capacity as mentioned hereafter (from https://networkx.github.io/documentation...value.html):

... If the graph has a path of infinite capacity, the value of a feasible flow on the graph is unbounded above and the function raises a NetworkXUnbounded.

So I am wondering if there are other ways to do that.
Any proposition ?

Thank you

[Larz60+]

Sorry, I was lucky to find that one.

[scidam]

What would happened, if you replaced infinity with a sufficiently large number?

[Larz60+]

Try it all it takes is time.

[Dav]

What would happened, if you replaced infinity with a sufficiently large number?

Try it all it takes is time.

Thank you so much, I appreciate your helps

The outgoing edges (from source node) should not have infinite capacities (and it does not matter if you put huge number or even infinity somewhere else)