Undirected Graph Is Given With The List Of Edges First Line Contains Number Of Vertices Each Next Line Contains An Edg 1 (20.72 KiB) Viewed 35 times
Write the code please, Java or C++
Undirected graph is given with the list of edges. First line contains number of vertices. Each next line contains an edge. Run Depth First Search (DFS) from the specified vertex. Print the last visited vertex during DFS. Input The first line contains number of vertices n. Next lines contains list of edges (read till the end of file). Output Run Depth First Search (DFS) from the vertex 5. Print the last visited vertex during DFS. Sample input 5 13 23 25 Sample output 1
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!