This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: also globally optimal. We will discuss two algorithms here  one of Kruskal and Prim. 2 Apply Kruskal’s Algorithm to the graph. 3 4 Part 1) can be implemented using merge sort in Part 2) can be implemented using a technique of flag component by having a flag for each edge reporting the corresponding component it belongs to in 5 Apply Prim’s Algorithm to the graph. 6 Show that if the weight of each edge in a graph is unique then the graph has unique minimum spanning tree....
View
Full Document
 Spring '09
 MarniMishna
 Graph Theory, Greedy algorithm, Kruskal's algorithm

Click to edit the document details