Graphs - Study Mode

[#61] What does the term "in-degree" refer to in the context of a directed graph?
Correct Answer

(B) The number of edges incoming to a vertex.

[#62] In a graph with weighted edges, what does the term "relaxation" refer to in shortest path algorithms?
Correct Answer

(C) Updating the shortest path estimate if a shorter path is found.

[#63] Which of the following methods is used to find the minimum cut in a graph?
Correct Answer

(D) Max-Flow Min-Cut Theorem

[#64] What is the significance of the "cut" in the context of the Max-Flow Min-Cut Theorem?
Correct Answer

(C) It represents a partition of the vertices into two sets, where the minimum cut is the smallest set of edges that, if removed, would disconnect the source from the sink.

[#65] Which traversal method is best for finding connected components in an undirected graph?
Correct Answer

(D) Depth-First Search (DFS)