D1: Kruskal's and Prim's

D1: Kruskal's and Prim's

By Julynda Pascua

Multiple Select

Which refers to a line connecting two nodes?

• vertex

• edge

• arc

• graph

Multiple Choice

This consists of points connected by lines

• tree

• path

• graph

• cycle

Multiple Choice

This is a connected graph with no cycles

• path

• tree

• trail

• spanning tree

Draw

Use Kruskal's Algorithm, find the minimum spanning tree

Draw

Use Prim's Algorithm, find the minimum spanning tree

Open Ended

Thinking about Question 1b - which algorithm will you choose to complete the tree and how it should be adapted?

Open Ended

State the difference between Kruskal's and Prim's algorithm?

Open Ended

List the arc in the order that you have chosen them for Prim's.

Open Ended

List the arc in the order that you have chosen them for Kruskal's.

Poll

How would you rate your knowledge and skill now in answering questions (on arc) of using Prim's and Kruskal's algorithm?

• 5 - Fully confident that I can answer questions on these now

• 3- I still need some study and practice

• 1 - I didn't get it - maybe because of so much terms I need to learn

• 0 - I need to talk to you more about this topic