1A directed graph with no cycles is called a:ATree alwaysBComplete graphCDAGDBipartite graphView AnswerDiscussWorkspaceReportSaveEasy
2Which algorithm finds shortest paths between all pairs of vertices?AFloyd–WarshallBKruskalCPrimDDijkstra (once)View AnswerDiscussWorkspaceReportSaveEasy
3A graph with an edge between every pair of vertices is:ABipartiteBSparseCCompleteDAcyclicView AnswerDiscussWorkspaceReportSaveEasy
4Which algorithm finds shortest paths from one source in a graph with non-negative weights?AKruskal's algorithmBPrim's algorithmCDijkstra's algorithmDDFSView AnswerDiscussWorkspaceReportSaveEasy
5A Hamiltonian path visits:AOnly the start vertex twiceBEvery vertex exactly onceCThe shortest routeDEvery edge exactly onceView AnswerDiscussWorkspaceReportSaveEasy