Question $1$

$1$ pts

Which of the following statements is true about depth first search $($DFS$)?$

It can be used for topological sorting with the extended use of visiting time and finishing time on the vertices.

It has a computing complexit of o$($mn$)$

It visited all neighbors of a vertex before moving on to other vertices.

It can be used to find the shortest path on any graph, including those with any weight values on the edges.