Week 6: Minimum Spanning Trees Flashcards by Connor M | Brainscape

Q

What is a Minimum spanning tree?

A

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is PRim’s algorithm?

A

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is the time complexity of Prim’s algorithm for the following two implementations:

Adjacency matrix

Adjacency list

A

How well did you know this?

1

Not at all

2

3

4

5

Perfectly