Question
What is the shortest-path distance between two unweighted vertices?
Select an option. Your answer will be checked instantly.
Correct Answer: C. The minimum number of edges required to connect them
Explanation:
Among all possible paths, the shortest path uses the fewest edges in an unweighted graph. Its length measures graph separation between the vertices.
Leave a Reply