基于图的深度优先搜索策略（耿7.10）--------西工大noj

​ 代码

代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct ArcNode{
    int to;
    struct ArcNode *next;
    int w;
}ArcNode;
typedef struct VertexNode
{
    int data;
    ArcNode *arc;
}VertexNode;
typedef struct Graph
{
    int max;
    VertexNode *vertex;
}Graph;
int dream;
int find;
Graph *Create(int n)
{
    Graph *G = (Graph*)malloc(sizeof(Graph));
    G->max = n;
    G->vertex = (VertexNode*)calloc(n+1,sizeof(VertexNode));
    for(int i = 0; i <= n; i++)
    {
        G->vertex[i].arc = NULL;
    }
    return G;
}
int Locate(Graph *G,int x)
{
    int i = 1;
    for(; i<=G->max; i++)
    {
        if(G->vertex[i].data == x)
            break;
    }
    if(i > G->max)
        return -1;
    else
        return i;
}
void Fill_VertexNode(Graph *G, int n)
{
    for(int i = 1; i <= n; i++)
    {
        scanf("%d",&G->vertex[i].data);
    }
}
void Add(Graph *G,int x, int y)
{
    int a = Locate(G,x);
    int b = Locate(G,y);
    ArcNode *A = (ArcNode*)malloc(sizeof(ArcNode));
    A->to = b;
    A->next = G->vertex[a].arc;
    G->vertex[a].arc = A;
}
void DFS(Graph *G,int *arr, int x)
{
    if(arr[x]==1)
        return;
    if(G->vertex[x].data == dream)
    {
        for(int i = 0; i <= G->max; i++) arr[i] = 1;
        find = 1;
        return ;
    }
    for(ArcNode *A = G->vertex[x].arc; A; A = A->next)
    {
        if(arr[A->to])
            continue;
        DFS(G,arr,A->to);
    }

}
int DFS_search(Graph*G, int x,int dre)
{
    find = 0;
    x = Locate(G,x);
    dream = dre;
    int *arr = (int *)calloc(G->max+1, sizeof(int));
    for(int i = 0; i <= G->max; i++)
    {
        arr[i] = 0;
    }
    DFS(G,arr,x);
    return find;
}
int main()
{
    int begin, end;
    int n,m;
    scanf("%d%d",&n,&m);
    Graph *G = Create(n);
    Fill_VertexNode(G,n);
    for(int i = 1; i <= m; i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        Add(G,x,y);
    }
    scanf("%d%d",&begin,&end);
    int ret = DFS_search(G,begin,end);
    if(ret) printf("yes");
    else printf("no");
    return 0;
}
/*
4 4
4 2 1 3
1 2
1 3
1 4
2 3
2 3

*/