1. MST: Find the minimum upanning tree (ignore the directions). 2. SP: Find the shortest path from node I to node?. 3. MF: Find the maximam flow from node I to node ? 4. CPM: - Find earliest \& latest occurrence times for cach event. - Find critical path, minimum duration to complete the project and ideatify critical activities and non-critical activities. - For tho non-critical activities, compute total and free float and identify red flag activities, - Create the timeschedule for all the activitics