![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-white.png)
McqMate
Q. |
The first step in the naïve greedy algorithm is? |
A. | analysing the zero flow |
B. | calculating the maximum flow using trial and error |
C. | adding flows with higher values |
D. | reversing flow if required |
Answer» A. analysing the zero flow | |
Explanation: the first step in the naïve greedy algorithm is to start with the zero flow followed by adding edges with higher values. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet