(a). For any connected graph G, all internal nodes of the BFS tree on G have the same number of children.
(b). For any connected graph G, the DFS tree on G and the BFS tree on G have the same number of edges.
(b). For any connected graph G, the DFS tree on G and the BFS tree on G have the same number of edges.
0 answers
3 answers
0 answers
1 answer