In the context of Graph Algorithms, do you agree or not with the given statement? "An efficient algorithm takes small amount of time and as well as small amount of space to solve a graph theory problem."
Answers
Answered by
1
Yes i agree with the given statement
zainablatif394:
Reason ?
Answered by
0
An efficient algorithm takes 'little amount of time' and as well as 'little amount of space' to find the solution for a graph theory problem.
Yes, I agree with the statement in the context of a graph algorithm. A graph algorithm is used to represent the problem statement graphically that is through a pictorial form.
Hence the user can easily find the smallest distance to solve the graph theory problem and pick the correct path to proceed with the problem.
Similar questions