1 / 1

Minimum Spanning Trees Quiz (Easy)

12. 8. 1. 2. 9. 3. 4. 7. 6. 12. 5. Minimum Spanning Trees Quiz (Easy). Circle a set of edges that constitute a minimum spanning tree. You may use either algorithm. Fill in the implementation of Kruskal’s Algorithm: Set A = empty set MinHeap H = empty heap Insert all Edges into H

rivka
Télécharger la présentation

Minimum Spanning Trees Quiz (Easy)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 12 8 1 2 9 3 4 7 6 12 5 Minimum Spanning Trees Quiz (Easy) • Circle a set of edges that constitute a minimum spanning tree. You may use either algorithm. • Fill in the implementation of Kruskal’s Algorithm: Set A = empty set MinHeap H = empty heap Insert all Edges into H while( ) { //assume E has pointers/references to //its endpoints: a & b Edge E = } Post condition: A is a set of edges constituting a minimum spanning tree. • Circle the best kind of data structure to use for the priority queue in Prim’s algorithm: Binary Heap Binomial Heap Sturgill Heap Union/Find Fibonacci Heap Hash Table Pile Mush

More Related