7.22.txt

数据结构实验 如下： Status Fibonacci(int k, int m, int &f) /* 求k阶斐波那契序列的第m项的值f */

Status DfsReachable(ALGraph g, int i, int j)
/* Judge if it exists a path from vertex 'i' to    */
/* vertex 'j' in digraph 'g'.                      */
/* Array 'visited[]' has been initialed to 'false'.*/                       
{
    ArcNode * p;
    int k;
    if( g.arcnum == 0) return ERROR;
    if(i == j) return OK;
    else {
        visited[i] = 1;
        for(p = g.vertices[i].firstarc; p; p = p->nextarc){
            k = p->adjvex;
            if(!visited[k] && DfsReachable(g, k, j)) return 1;
        }
    }
    return ERROR;
}