Posted by Omar on August 13, 19100 at 19:30:43:
Can anyone advise me which algorithm best suits
finding maximal capacity link between 2 verteces ?
I. e. to find "a route" through the graph that edges
are valued by capacity. Therefore, minimal capacity on
the route determines the maximal capacity between the set 2 verteces.
I would welcome some reference to language implementation in Pascal.
Thank you very much.