What do Prim's algorithm and Kruskal's algorithm do after they take a graph?
a. Construct a minimum spanning tree
b. Create a shortest path from the graph
c. Remove all cycles or loops from the graph
d. Find the average weight of the edges
a. Construct a minimum spanning tree
Both algorithms construct at minimum spanning tree on a graph.
You might also like to view...
Describe tiles
What will be an ideal response?
When configuring folder and file permissions, use the ____ button on the folder properties Security tab to change which groups and users have permissions to a folder.
A. General B. Edit C. Modify D. Tools
Primary Major Horizontal is an example of a type of _____________________.
Fill in the blank(s) with the appropriate word(s).
Which of the following statements draws the string "Love to animate!" starting at coordinates (200, 50)?
a. Text myText = new myText(200, 50, "Love to animate!"); b. Text myText = new Text(50.0, 200.0, "Love to animate!"); c. Text myWords = new Text(200.0, 50.0, "Love to animate!"); d. Text Words = new Words(200, 50, "Love to animate!");