Suppose we have a graph such that we want to apply a maximum flow algorithm(for example Edmonds Karp) on it.
And suppose we only know that graph's diameter is 70 so we want to calculate that's time comlexity .
As you know , Edmonds Karp time complexity is O(V.E^2).
We can conclude that we must know V and E of the graph to compute it's worst case time complexity. But I don't know how to find vertices or edges of the graph based on the diameter . Any ideas?