11Kruskal's algorithm builds a minimum spanning tree by:AUsing DFS onlyBRemoving the heaviest edges firstCGrowing from one vertexDAdding the cheapest edges that do not form a cycleView AnswerDiscussWorkspaceReportSaveEasy
12Which algorithm finds shortest paths from one source in a graph with non-negative weights?APrim's algorithmBDijkstra's algorithmCDFSDKruskal's algorithmView AnswerDiscussWorkspaceReportSaveEasy
13The sum of the degrees of all vertices in an undirected graph with 12 edges is:A24B12C6D144View AnswerDiscussWorkspaceReportSaveMedium
14A complete graph with 7 vertices has how many edges?A42B49C21D14View AnswerDiscussWorkspaceReportSaveMedium
15Which traversal uses a stack (or recursion)?ADepth-first searchBDijkstraCBreadth-first searchDLevel orderView AnswerDiscussWorkspaceReportSaveEasy