不需要回溯么?
> void Euler(int node) 
> { 
>     int i; 
>     for(i=1;i<=maxStreet;i++) 
>     { 
>         if(graph[node][i]!=0&&!mark[i]) 
>         {     
>             mark[i]=1; 
>             Euler(graph[node][i]); 
>             stack[top]=i; 
>             top++; 
>         }         
>     } 
>      
> }