Home /
Expert Answers /
Computer Science /
need-it-asap-thankyou-questions-11-to-13-are-based-on-figure-2-as-follow-figure-2-graph-of-f-pa786

need it asap, thankyou

Questions 11 to 13 are based on Figure 2 as follow: Figure 2: Graph of Flight Plan 11. Suppose Dijkstra's algorithm is used to get the shortest path from London to * Kuala Lumpur. At one phase, the solution set, $S={$ London, Paris, Jakarta $}$. Please determine the cities in the frontier set, F. $F={$ Bahrain, Qatar, K.Lumpur $}$ $F={$ Jakarta, Qatar, Bahrain $}$ $F={$ Delhi, London, Bahrain $}$ $F={Q$ Qatar, Delhi, Bahrain $}$
12. To find the minimum spanning tree for of Figure 2, Kruskal's algorithm has * been used. What is the final minimum spanning tree cost obtained? 420 390 400 410 13. What is the result after the breadth first search (BFS) traversal is performed * to find paths in the graph from London? London, Paris, Qatar, Bahrain, Jakarta, Delhi, K.Lumpur London, Qatar, Paris, Bahrain, Delhi, Jakarta, K.Lumpur London, Paris, Qatar, Jakarta, Bahrain, Delhi, K.Lumpur London, Qatar, Bahrain, Paris, Delhi, Jakarta, K.Lumpur

11). d) F = {Qatar, Delhi, Bahrain} is the correct answer.The frontier set, F, represents the set of nodes that have not yet been processed by the alg