[dfs] Forum Topics

#include <iostream> #include <iomanip> #include <stack> #include <queue> #include <vector> #include <fstream> using namespace std; class graph { public: graph(); graph(int); //graph(int, int); void setEdge(int src, int dst); void printGraph();//print graph void bfs(int);//Breadth First Search void dfs(int);//Depth First Search void bfsSpan(int);//Breadth First Search Spanning Tree void dfsSpan(int);//DepthFirt Search Spanning Tree …

I am doing a program to do dfs traversal given the adjacency matrix. My code follows: [CODE] #include <iostream> #define SIZE 10 using namespace std; bool M[SIZE][SIZE]; int flag[SIZE]; int dfsNum[SIZE], num; int n; void dfs( int u, int p ) { flag[u] = 1; dfsNum[u] = num++; for( int …