7.23.txt

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

Status BfsReachable(ALGraph g, int i, int j) 
/* Determine whether it exists path from vertex i to */
/* vertex j in digraph g with Breadth_First Search.  */
/* Array 'visited' has been initialed to 'false'.    */
{
    Queue q;
    int k, u;
    ArcNode *p;
    if( g.arcnum == 0) return ERROR;
    if(i == j) return OK;
    else {
        visited[i] = 1;
        EnQueue(q, i);
        while(!QueueEmpty(q)){
            DeQueue(q, u);
            for(p = g.vertices[u].firstarc; p; p = p->nextarc){
                k = p->adjvex;
                if(k == j) return 1;
                if(!visited[k]){
                    visited[k] = 1;
                    EnQueue(q, k);
                }
            }
        }
    }
    return ERROR;
}