连通图中欧拉路径的存在性问题

int GraphPathE(Graph G, int v, int w)
{   
    int t;
    t = Graphdeg(G, v) + Graphdeg(G, w);
    if ((t % 2) != 0) return 0;
    for (t = 0; t < G->V; t++)
        if ((t != v) && (t != w))
            if ((Graphdeg(G, t) % 2) != 0) return 0;
    return 1;
}