Flow Problem on Data Structure and Algorithms related Questions and Answers

Question :   The first step in the naïve greedy algorithm is? 1. analysing the zero flow 2. calculating the maximum flow using trial and error 3. adding flows with higher values 4. reversing flow if required 5. Answer :   1 - analysing the zero flow