please solve in Java!!
2. Let G=(V,E) be a connected, undirected graph. Give an O(V+E)-time algorithm to find a path in
G that traverses each edge in E exactly once in each direction, your algorithm should print the
path found. (Give a clear description of the algorithm and complexity analysis and write clear
pseudocode for your algorithm) Run your algorithm on the graph with the following adjacency list:
a:b,cb:a,c,dc:a,b,d,e,gd:b,c e: c,f,gf:e,gg:c,e,f Hint: Use a modification of the DFS algorithm.
please solve in Java 2 Let GVE be a connected undire.pdf
1. please solve in Java!!
2. Let G=(V,E) be a connected, undirected graph. Give an O(V+E)-time algorithm to find a path in
G that traverses each edge in E exactly once in each direction, your algorithm should print the
path found. (Give a clear description of the algorithm and complexity analysis and write clear
pseudocode for your algorithm) Run your algorithm on the graph with the following adjacency list:
a:b,cb:a,c,dc:a,b,d,e,gd:b,c e: c,f,gf:e,gg:c,e,f Hint: Use a modification of the DFS algorithm
