File:Minimum cut in a bipartite graph.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 800 × 470 pixels. Other resolutions: 320 × 188 pixels | 640 × 376 pixels | 1,024 × 602 pixels | 1,280 × 753 pixels | 2,560 × 1,505 pixels | 2,488 × 1,463 pixels.
Original file (SVG file, nominally 2,488 × 1,463 pixels, file size: 43 KB)
Summary
| Description |
English: Illustration to how maximum flow/minimum cut looks in bipartite graphs |
| Date | |
| Source | Own work |
| Author | Adamant.pwn |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
- You are free:
- 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.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 20:53, 6 August 2022 | | 2,488 × 1,463 (43 KB) | wikimediacommons>Adamant.pwn | subscripts for A_S, A_T, B_S, B_T |
File usage
The following page uses this file:
