A

Admin • 828.03K Points
Coach

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
Explanation by: Admin
the first step in the naïve greedy algorithm is to start with the zero flow followed by adding edges with higher values.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.