if we have a graph G with 9 vertices, 20 edges that are connected, undirected. DFS algorithm will give how many back edg
Posted: Tue Jul 12, 2022 8:20 am
if we have a graph G with 9 vertices, 20 edges that are connected, undirected. DFS algorithm will give how many back edges? and tree edges?