# Problem in understanding time Complexity of Ford-Fulkerson Algorithm for Maximum Flow Problem? plz Help

Time Complexity:
Time complexity of the above algorithm is O(max_flow * E). We run a loop while there is an augmenting path. In worst case, we may add 1 unit flow in every iteration. Therefore the time complexity becomes O(max_flow * E)
{"ft_lang_label":"__label__en","ft_lang_prob":0.88492084,"math_prob":0.9282766,"size":849,"snap":"2023-14-2023-23","text_gpt3_token_len":211,"char_repetition_ratio":0.12071006,"word_repetition_ratio":0.0,"special_character_ratio":0.23321554,"punctuation_ratio":0.05421687,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9758621,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-23T04:59:09Z\",\"WARC-Record-ID\":\"<urn:uuid:5766bc82-1168-4deb-a987-d9fa04a72364>\",\"Content-Length\":\"12890\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7c88ed17-d6ea-45b8-bb47-a233ae5514e6>\",\"WARC-Concurrent-To\":\"<urn:uuid:cd10cb1a-c284-4b62-89bb-f563d39518ae>\",\"WARC-IP-Address\":\"34.199.108.46\",\"WARC-Target-URI\":\"https://discuss.codechef.com/t/problem-in-understanding-time-complexity-of-ford-fulkerson-algorithm-for-maximum-flow-problem-plz-help/18675\",\"WARC-Payload-Digest\":\"sha1:675BF2SXF5EBCO376R2P5IJIKQAVKWTZ\",\"WARC-Block-Digest\":\"sha1:LKPIJOJ5IFAZLYZLDIN2PVBWGMZTI4YN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296944996.49_warc_CC-MAIN-20230323034459-20230323064459-00238.warc.gz\"}"}