Asked by aj
(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.
Answers
There are no AI answers yet. The ability to request AI answers is coming soon!
There are no human answers yet. A form for humans to post answers is coming very soon!