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
The question was asked during an online exam.
I need to ask this question from Flow Networks in division Flow Networks of Data Structures & Algorithms II