Which of the following are applications for DFS when we have an unweighted directed graph at hand.
1.Single source shortest path from the source vertex.
2 Topological sorting of the vertices
3 Strongly connected components of the graph.
4 Detection of cycles in the graph.
Can we use unweighted directed graph in Topological sorting ??
.