Consider the weighted, directed graph containing the following vertices and edges. (Weights are in the parentheses.) Vertices: {A, B, C, D} Edges: {AB(5), BC(3), CA(4), AD(2), DA(4), CB(3)} a. Starting at vertex C, determine the shortest path tree using Dijkstra b. If you were to apply Floyd-Warshall’s algorithm to this tree, would it include the shortest path tree you found using Dijkstra? Why or why not? c. Starting at vertex C, determine the minimum spanning tree using Prim. d. Would Kruskal’s algorithm always result in the same MST as Prim’s? Why or why not?

icon
Related questions
Question

1. Consider the weighted, directed graph containing the following vertices and edges.
(Weights are in the parentheses.)
Vertices: {A, B, C, D} Edges: {AB(5), BC(3), CA(4), AD(2), DA(4), CB(3)}
a. Starting at vertex C, determine the shortest path tree using Dijkstra
b. If you were to apply Floyd-Warshall’s algorithm to this tree, would it include the shortest path tree you found using Dijkstra? Why or why not?
c. Starting at vertex C, determine the minimum spanning tree using Prim.
d. Would Kruskal’s algorithm always result in the same MST as Prim’s? Why or why not?

 

Please provide graphs if possible.

Expert Solution
steps

Step by step

Solved in 6 steps with 10 images

Blurred answer
Knowledge Booster
Single source shortest path
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, data-structures-and-algorithms and related others by exploring similar questions and additional content below.
Similar questions