Question 6 Given the following graph representing some feasible paths an aircraft can follow. Consider that the aircraft
Posted: Fri Apr 29, 2022 9:41 am
Question 6 Given the following graph representing some feasible paths an aircraft can follow. Consider that the aircraft needs to fly from node a to node g. Find out the shortest path using Dijkstra's algorithm. (10 marks) b d 6 4 4 2 2 6 a g 3 7 3 3 1 f