Mark the start and end time for the Depth first search traversal of the graph be

Question

Mark the start and end time for the Depth first search traversal of the graph below. Start at vertex s and visit neighbors in alphabetical order. EXTRA CREDIT: Perform topological sort on the graph assuming that the direction of edges is always in the alphabetical order i.e., the direction of edge between r and s is from r to s.

Explanation / Answer

#include #include using namespace std; vector adj[10]; bool visited[10]; void dfs(int s) { visited[s] = true; for(int i = 0;i > nodes; //Number of nodes cin >> edges; //Number of edges for(int i = 0;i > x >> y; //Undirected Graph adj[x].push_back(y); //Edge from vertex x to vertex y adj[y].push_back(x); //Edge from vertex y to vertex x } initialize(); //Initialize all nodes as not visited for(int i = 1;i

Related Questions

Navigate

• Browse (All)
• Browse M
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.