Vidyalelo
Data Structure · Q347

Miscellaneous on Data Structures

Programming · Data Structure · question 347

Q347

The first step in the naive greedy algorithm is?

A.
analysing the zero flow
Answer
B.
calculating the maximum flow using trial and error
C.
adding flows with higher values
D.
reversing flow if required

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board