#include <iostream>
#define  MaxVerNum  100   
typedef char ElemType;
using namespace std; 
typedef struct 
{    ElemType vexs[MaxVerNum];
     int  arcs[MaxVerNum][MaxVerNum];
     int  vernum, arcnum;
}AMGraph;
int LocateVex(AMGraph G,ElemType v)
{
	for(int i=0;i<G.vernum;i++)
	{
		if(G.vexs[i]==v)
		return i;
	}
}
void  CreateUDG(AMGraph  &G)
{   int i,j,k;
    ElemType v1,v2;
    cout<<"請依次輸入圖的頂點數和邊數！\n";
    cin>>G.vernum >>G.arcnum;
    for (i=0;i<G.vernum;i++){
	    cout<<"請輸入頂點值；\n";
        cin>>G.vexs[i];
		}  
    for (i=0;i< G.vernum;i++)
        for (j=0;j<G.vernum;j++)
            G.arcs[i][j]=0;    
    for (k=1;k<=G.arcnum;k++)
      {   cout<<"請輸入一條邊；\n";
	      cin>>v1>>v2; 
          i=LocateVex(G,v1);j=LocateVex(G,v2);
          G.arcs[i][j]=G.arcs[j][i]=1;
      }
}
bool  visited[MaxVerNum];   
int e=0;
void  DFS(AMGraph G,int v)  
  {  int w;
     cout<<G.vexs[v];    visited[v]=true;  
      for ( w=0; w<G.vernum; w++ ) { 
           
           
		    if(G.arcs[v][w]==1)
              e++;
            if(G.arcs[v][w]==1&&!visited[w])
			  DFS(G,w);
		   
		
  }
}
void DFSTraverse(AMGraph G)
   {   int v=0;
       for (v=0;v<G.vernum;v++) 
            visited[v]=false;
       for (v=0;v<G.vernum;v++) 
            if (!visited[v])   {   DFS(G,v); }
   }
int  DFSTraverse1(AMGraph G)
   {   int k=0,v;
       for (v=0;v<G.vernum;v++) 
            visited[v]=false;
       for (v=0;v<G.vernum;v++) 
            if (!visited[v])   { k++;   DFS(G,v); }
        e=e/2;
        return  k;
   }


int main()
{
	AMGraph G;
	int m;
	CreateUDG(G);
	cout<<"該圖按深度優先序列輸出為；";
	m=DFSTraverse1(G);
	cout<<"\n該圖的連通分量數為；"<<m;
	cout<<"\n該圖的邊數為；"<<e;
}