COL106: Data Structures and Algorithmsrjaiswal/2017/COL106/Slides/Week-12/lec-2.pdf · Minimum...

COL106: Data Structures and Algorithms

Ragesh Jaiswal, IIT Delhi

Ragesh Jaiswal, IIT Delhi COL106: Data Structures and Algorithms

Greedy Algorithms: Minimum Spanning Tree (MST)

Greedy AlgorithmsMinimum Spanning Tree

Spanning Tree: Given a strongly connected graphG = (V ,E ), a spanning tree of G is a subgraph G ′ = (V ,E ′)such that G ′ is a tree.

Minimum Spanning Tree (MST): Given a strongly connectedweighted graph G = (V ,E ), a Minimum Spanning Tree of Gis a spanning tree of G of minimum total weight (i.e., sum ofweight of edges in the tree).

Problem

Given a weighted graph G where all the edge weights are distinct,give an algorithm for finding the MST of G .

Theorem

Cut property: Given a weighted graph G = (V ,E ) where all theedge weights are distinct. Consider a non-empty proper subset S ofV and S ′ = V \ S . Let e be the least weighted edge between anypair of vertices (u, v), where u is in S and v is in S ′. Then e isnecessarily present in all MSTs of G .

Algorithm

Prim’s Algorithm(G)

- S ← {u} //u is an arbitrary vertex in the graph- T ← {}- While S does not contain all vertices

- Let e = (v ,w) be the minimum weight edge betweenS and V \ S

- T ← T ∪ {e}- S ← S ∪ {w}

Algorithm

Kruskal’s Algorithm(G)

- S ← E ; T ← {}- While the edge set T does not connect all the vertices

- Let e be the minimum weight edge in the set S- If e does not create a cycle in T

- T ← T ∪ {e}- S ← S \ {e}

Algorithm

- T ← T ∪ {e}- S ← S ∪ {w}

Algorithm

- T ← T ∪ {e}- S ← S ∪ {w}

Algorithm

- T ← T ∪ {e}- S ← S ∪ {w}

Algorithm

- T ← T ∪ {e}- S ← S ∪ {w}

Algorithm

- T ← T ∪ {e}- S ← S ∪ {w}

Algorithm

- T ← T ∪ {e}- S ← S ∪ {w}

Algorithm

- T ← T ∪ {e}- S ← S \ {e}

Algorithm

- T ← T ∪ {e}- S ← S \ {e}

Algorithm

- T ← T ∪ {e}- S ← S \ {e}

Algorithm

- T ← T ∪ {e}- S ← S \ {e}

Algorithm

- T ← T ∪ {e}- S ← S \ {e}

Algorithm

- T ← T ∪ {e}- S ← S \ {e}

Algorithm

- T ← T ∪ {e}- S ← S ∪ {w}

What is the running time of Prim’s algorithm?

Algorithm

- T ← T ∪ {e}- S ← S ∪ {w}

What is the running time of Prim’s algorithm?O(|E | · log |V |)

Using a priority queue.

Algorithm

- T ← T ∪ {e}- S ← S \ {e}

Algorithm

- //Note that G ′ = (V ,T ) contains dicsonnected components- Let e = (u, v) be the minimum weight edge in the set S- If e does not create a cycle in T- If u and v are in different components of G ′

- T ← T ∪ {e}- S ← S \ {e}

Union-Find: Used for storing partition of a set of elements.The following two operations are supported:

1 Find(v): Find the partition to which the element v belongs.2 Union(u, v): Merge the partition to which u belongs with the

partition to which v belongs.

Consider the following data structure.

Suppose we start from a full partition (i.e., each partitioncontains one element).

How much time does the following operation take:

Find(v):Union(u, v):

Find(v): O(1)Union(u, v):

Claim: Performing k union operations takes O(k log k) time inthe worst case when starting from a full partition.Proof sketch: For any element u, every time its pointer needsto be changed, the size of the partition that it belongs to atleast doubles in size. This means that the pointer for u cannotchange more than O(log k) times.

Kruskal’s algorithm using Union-Find.

Algorithm

- T ← {}- Let S be the list of edges sorted in increasing order of weight- While the edge set T does not connect all the vertices

- //Note that G ′ = (V ,T ) contains dicsonnected components- Let e = (u, v) be the next edge in the list S- If e does not create a cycle in T- If u and v are in different components of G ′

- If (Find(u) 6= Find(v))- T ← T ∪ {e}- Union(u, v)

What is the running time of the above algorithm?

Kruskal’s algorithm using Union-Find.

Algorithm

- T ← {}- Let S be the list of edges sorted in increasing order of weight- While the edge set T does not connect all the vertices

- //Note that G ′ = (V ,T ) contains dicsonnected components- Let e = (u, v) be the next edge in the list S- If e does not create a cycle in T- If u and v are in different components of G ′

- If (Find(u) 6= Find(v))- T ← T ∪ {e}- Union(u, v)

What is the running time of the above algorithm? O(|E | · log |V |)

Greedy AlgorithmsShortest path

Path length: Let G = (V ,E ) be a weighted directed graph.Given a path in G , the length of a path is defined to be thesum of lengths of the edges in the path.

Shortest path: The shortest path from u to v is the path withminimum length.

Greedy AlgorithmsShortest path

Path length: Let G = (V ,E ) be a weighted directed graph.Given a path in G , the length of a path is defined to be the sumof lengths of the edges in the path.Shortest path: The shortest path from u to v is the path withminimum length.

Problem

Single source shortest path: Given a weighted, directed graphG = (V ,E ) with positive edge weights and a source vertex s, find theshortest path from s to all other vertices in the graph.

COL106: Data Structures and Algorithmsrjaiswal/2017/COL106/Slides/Week-12/lec-2.pdf · Minimum...

Documents

Design and Analysis of Algorithms...1 Huffman Coding 2 Shortest Path Problem Dijkstra’s Algorithm 3 Minimal Spanning Tree Kruskal’s Algorithm Prim’s Algorithm 3/83 ©Yu Chen

Kruskal’s Minimum Spanning Tree Algorithm & Union …ckingsf/class/02713/lectures/lec04-other... · Kruskal’s Minimum Spanning Tree Algorithm & Union-Find Data Structures Slides

CASE STUDY sixteen - dssbooks.comdssbooks.com/.../ChapterFiles/CaseStudies/CS16.Kruskal-Algorithm.pdf · CASE STUDY 16 Kruskal’s Algorithm 2 CS16.1 Application Overview and Model

FEATURE SELECTION METHOD FOR HIGH DIMENSIONAL DATA€¦ · Keywords— Feature subset selection, filter method, feature clustering, graph based clustering, kruskal’s algorithm

Minimum Spanning Tree - Mathematical Sciences …homepage.cs.uiowa.edu/~ghosh/16612.week9.pdf · Sequential algorithms for MST Review (1) Prim’s algorithm and (2) Kruskal’s algorithm

DESIGN AND ANALYSIS OF ALGORITHMSmadhavan/nptel-algorithms-2015/week4/pdf/… · Kruskal’s algorithm, reﬁned algorithm Kruskal Let E = [e 1,e 2,…,e m] be edges sorted by weight

Improving Kruskal’s Algorithm · Kruskal’s Algorithm Procedure kruskal(E,T : Sequence of Edge,P : UnionFind) sort E by increasing edge weight foreach {u,v} ∈ E do if u and v

Data Structures and Algorithms - Columbia Universitybert/courses/3137/Lecture20.pdf · Minimum Spanning Tree Prim’s Algorithm Kruskal’s Algorithm Depth ﬁrst search Euler Paths

Running Time of Kruskal’s Algorithm Huffman Codes Monday, July 14th

Minimum Spanning Trees and Prim's Algorithm · algorithms. The two major ones are Prim’s algorithm and Kruskal’s algorithm, Version of October 23, 2014 Minimum Spanning Trees

2016-1-9 2004 SDU Lecture 6- Minimum Spanning Tree 1.The Minimum Spanning Tree Problem 2.Greedy algorithms 3.A Generic Algorithm 4.Kruskal’s Algorithm

UNIT 1 GREEDY TECHNIQUES Greedy Techniques Greedyignou.ac.in/userfiles/sandeep_BCS-042Block2_Unit1_Greedy... · 2013-04-03 · 1.5.1: Kruskal’s Algorithm 1.5.2: Prim’s algorithm

wccclab.cs.nchu.edu.twwccclab.cs.nchu.edu.tw/.../quiz2_answer.docx · Web viewPlease apply Kruskal’s algorithm to drive the minimum cost spanning tree. Note that you must show your

Minimum Spanning Tree Algorithms Prim’s Algorithm Kruskal’s Algorithm Runtime Analysis Correctness Proofs

Spanning Trees, greedy algorithms...Kruskal’s algorithm —which data structures can be used to get a really efficient algorithm. Leave that for later courses, or you can look them

Prim’s and Kruskal’s Algorithm

MINIMUM SPANNING TREES: PRIM-JARNIK’S ALGORITHM KRUSKAL’S ALGORITHM CS16: Introduction to Data Structures & Algorithms Thursday, April 2, 2015 1

Chapter 8: The Disjoint Set Class Equivalence Classes Disjoint Set ADT CS 340 Page 132 Kruskal’s Algorithm Disjoint Set Implementation

1 The Minimum Spanning Tree Problem Distributing Prim’s and Kruskal’s Algorithm

2.4 mst kruskal’s