V - CISE

More documents

Recommendations

Info

Running time: O(E lgV) � Using binary heaps to implement Q � Initialization: O(V) � Building initial queue : O(V) � V Extract-Min’s : O(V lgV) � E Decrease-Key’s : O(E lgV) Note: Using Fibonacci heaps can save time of Decrease-Key operations to constant (chapter 19) => running time: O(E + V lg V) My T. Thai mythai@cise.ufl.edu 16
Example My T. Thai mythai@cise.ufl.edu 17
Page 1 and 2: Introduction to Algorithms Minimum
Page 3 and 4: Minimum Spanning Tree (MST) Problem
Page 6 and 7: Some definitions � An edge is a l
Page 8 and 9: Corollary � In GENERIC-MST � A
Page 10 and 11: Disjoint-set data structure � Mai
Page 12 and 13: Example My T. Thai mythai@cise.ufl.
Page 14 and 15: Prim’s Algorithm � Builds one t
Page 18 and 19: My T. Thai mythai@cise.ufl.edu 18
Page 20: Summary � Prim’s algorithm star

V - CISE

Create successful ePaper yourself

Delete template?

Save as template?