Graph Traversal in Data Structures: A Complete Guide

SOLVED: Find a traversable trail α for the graph G whereV(G)=A,B,C,D and E(G)=[A,C,A,D,B,C,B,D,C,D]

Perform depth-first search on each of the following graphs; whenever there's a choice of vertices,pick the one that is alphabetically first. Classify each edge as a tree edge, forward edge, backedge, or cross edge, and give the pre and post number of each vertex.