#include
using namespace std;
int visited[10]={0};
class MGraph
{
public :
MGraph(char a[],int n,int e); ~MGraph(){} void DFSTraverse(int v); void BFSTraverse(int v); void PrintArc(int b);
private :
};
void MGraph::PrintArc (int b) {
int j,k=0; for(j=0;j
} } cout
void MGraph::BFSTraverse(int v) {
int visited1[10]={0},Q[10],j; int front,rear; front=rear=-1; cout
} MGraph::MGraph(char a[],int n,int e) {
}
void MGraph::DFSTraverse (int v) {
int j; int i,j,k; vertexNum=n; arcNum=e; for(i=0;ii>>j; arc[i][j]=1; //arc[j][i]=1;
} visited[v]=1; for(j=0;j
int main() { } char a[10]; int n,e,i,b; cin>>n>>e; for(i=0;i>a[i]; MGraph A(a,n,e); cin>>b; A.PrintArc (b); return 0;
#include
using namespace std;
int visited[10]={0};
class MGraph
{
public :
MGraph(char a[],int n,int e); ~MGraph(){} void DFSTraverse(int v); void BFSTraverse(int v); void PrintArc(int b);
private :
};
void MGraph::PrintArc (int b) {
int j,k=0; for(j=0;j
} } cout
void MGraph::BFSTraverse(int v) {
int visited1[10]={0},Q[10],j; int front,rear; front=rear=-1; cout
} MGraph::MGraph(char a[],int n,int e) {
}
void MGraph::DFSTraverse (int v) {
int j; int i,j,k; vertexNum=n; arcNum=e; for(i=0;ii>>j; arc[i][j]=1; //arc[j][i]=1;
} visited[v]=1; for(j=0;j
int main() { } char a[10]; int n,e,i,b; cin>>n>>e; for(i=0;i>a[i]; MGraph A(a,n,e); cin>>b; A.PrintArc (b); return 0;