bool map[100][100];
 bool visit[100];   

  void DFS()
{   
  Stack를 저장한다;     
  for (int i=0; i<100; i++)         
 visit[i] = false;   

 for (int i=0; i<100; i++)     
    if (!visit[i])      
  {           
  stack.push(i);              
    visit[s] = true;           
    while (!stack.empty())        
 {              
   int s = stack.pop();            
    for (int t=0; t<100; t++)                  
  if (map[s][t] && !visit[t])                  
  {                        
 stack.push(t);                       
  visit[t] = true;                     
 }            
 }        
 }
 }