Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:这个题目的算法是什么?

Posted by mathzqy at 2004-08-01 22:59:41 on Problem 1041
In Reply To:这个题目的算法是什么? Posted by:ZionMatrix at 2004-08-01 20:41:45
> 简单的搜索要超时的说……
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++; 
        }         
    } 
     
} 

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator