DMU6D3 Skill Check Kruskal's Algorithm

Kruskal's Algorithm is used to

• Find the Euler circuit for a network

• Find a good solution to traveling salesperson problem(TSP)

• Find a minimum spanning tree for a non-directed graph

• Find the critical path for a project

Kruskal's algorithm is most similar to

• Eulerizing a graph to find an Euler circuit

• Cheapest link algorithm for finding a decent tour for a traveling salesperson problem.

• Nearest neighbor algorithm for finding a decent tour for a traveling salesperson problem.

• Brute force algorithm for finding the optimal tour for a traveling salesperson problem.

How many edges are needed to make a MST (minimum spanning tree) for this network?

• 10

• 13

• 14

• 15

Using Kruskal's Algorithm, which edge must be included in a MST (minimum spanning tree) for this network?

• HG

• HI

• LF

• LM

Using Kruskal's Algorithm, the first three edges selected for this network are?

• LM, AJ, EF

• LM, EF, FG

• LM, AJ, KN

• AJ, EF, KN

How many edges must be used for a MST of this network?

• 4

• 5

• 6

• 7

Using Kruskal's Algorithm, the first edge selected is

• AD

• AE

• AC

• EC

Using Kruskal's Algorithm, the edges selected for a MST are

• AC, AD, AE, CE

• AC, AD, CE, ED

• AC, AD, CB, CE

• AC, AD, CD, ED

The minimum number of edges of a MST for this network is

• 4

• 5

• 6

• 7

Using Kruskal's Algorithm, the following edges will give the MST of the network

• AB, AC, BF, CD, EC

• AB, AC, CD, DE, EF

• AC, BE, CD, CE, EF

• AB, BF, FE, CE, DC