Question

Tarjan’s algorithm is used to find:

A Minimum spanning tree
B Strongly connected components
C Shortest path
D Maximum flow
E Cut vertices
Practice Next

Hey! Ask a query