'Can a flow network graph exist without a path from the source to the sink?
Currently I'm trying to build a flow network that will determine if a flight path can be taken from a source (starting city), possibly through various other nodes (other cities) to the sink (target city). However I can not garuantee that there will be a existing flight path from the source to the sink and thus I'm wondering if this scenario would still construct a valid flow network?
A further question would be what value would Ford-Fulkerson's and Edmonds-Karp's respective algorithms return upon analysing the given graph in this scenario? I.e would they return 0 as there is no max flow from source to sink, or would they return the maximum flow they recorded before terminating without finding the sink.
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|