[PATCH] D109860: profi - a flow-based profile inference algorithm: Part I (out of 3)

[Rajeshwar Vanka via Phabricator via llvm-commits]

rajeshwarv added inline comments.


================
Comment at: llvm/lib/Transforms/Utils/SampleProfileInference.cpp:75
+/// path and capacity scaling. The estimated time complexity is
+/// O(v(f)*m*log(n)), where m is the number of edges and v(f) is the value of
+/// the max flow.
----------------
Could you please why the time complexity is not O(V*E^2) per http://go/wikip/Edmonds%E2%80%93Karp_algorithm and it is actually O(...) as described here?

Also, what is n? 


Repository:
  rG LLVM Github Monorepo

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D109860/new/

https://reviews.llvm.org/D109860