Virual Oral Presentation Slide by Slide

IEEE/ICACT20210213 Slide.11        [Big Slide]       [YouTube]	Oral Presentation
	The algorithm finds that the maximum flow capacity that could be sent from the s to d is 4. then it finds the minimum number of edges with that maximum capacity. Once the edges are cut we pick from the cut set the edge with maximum available capacity and save it as part of our path.

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!