This question is in reference to BFS and DFS for data structures
and algorithms
Consider a graph algorithm with a growth function on V and E:
f(V, E). How would you convert f(V,E) to f'(V) such that
f(V,E)=O(g(n))=f(V)? (That is, convert a growth function of two
variables to be of one variable in such a way that the Big-Oh bound
for the one variable function will hold for the two variable
function.) Explain the steps in creating f', and explain...