# Quiz: Shortest Paths

Reinforce your understanding of shortest paths and their applications in problem solving.

1

Which problem is solved by almost every algorithm known for computing shortest paths from one vertex to another in a graph?

A)

Minimum spanning tree problem

B)

Single-source shortest path problem

C)

All-pairs shortest path problem

D)

Bipartite matching problem

Question 1 of 50 attempted

Create a free account to access the full course.

By signing up, you agree to Educative's Terms of Service and Privacy Policy