English: The diagram for Bidirectional pushing with Linear Component Operations (BILCO) algorithm. The max-flow problem is analogized to pumping water from connected water tanks. Each GTW subgraph is a water tank and the flow is just the water flow. The algorithm iteratively operates ``Drain’’ operations (drain water from water tank) and ``Discharge’’ operations (exchange water between adjacent water tanks) until reaching the max-flow.
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Please help improve this media file by adding it to one or more categories, so it may be associated with related media files (how?), and so that it can be more easily found.
Please notify the uploader with
{{subst:Please link images|File:Diagram for BILCO algorithm.png}} ~~~~
Captions
The diagram for Bidirectional pushing with Linear Component Operations (BILCO) algorithm.