c++
Suppose the above graph class uses the following adjacency listimplementation:
where the constructor sets the sizeof adj_list to node_count. Write the implementationof the recursive DFS function using this implementation(cout the node's number when it is first explored; you don'thave to worry about distance, parents, starting or endingtimes):
1 3 O 5 2 8 4
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!