following question on undirected graph without weights can be solved by using DFS and in O(|V|+|E|) times.check that G is bipartite.check G has one simple cycle.find number of connected component G with given two vertex u, v, find a path between u and v with minimum edgesanyone can describe, how the authors of this note claim that all of them can be checked with DFS and in O(|V|+|E|) times?
undirected graph without weights and DFS
algorithms;graph theory;graphs;data structures;trees