The third step in the shortest route solution method is to Oselect the closest node not presently in the spanning tree O determine all nodes directly connected to the permanent set nodes add the maximal flow along the path to the flow in the opposite direction at each node Onone of the above