SPFA算法

最短路径问题，是队列优化的bellman-ford

时间复杂度O(kE)  k<<V

int SPFA(int s)
{
    int i;
    bool visit[N] = {false};
    int front = 0, rear = 0; 
    memset(queue,0,sizeof(queue));
    for(i=1;i<=n;i++)
        d[i] = MAX;
    //int path[N];
    queue[front] = s;
    visit[s] = true;
    d[s] = 0;
    while(front<=rear)
    {
        int u = queue[front];
        visit[u] = false;//可以回头
        for(int i=1; i<=n; i++)
        {
            if (d[i]>d[u]+ edges[u][i])
            {
                d[i]= d[u]+edges[u][i];
                //path[i] = u;
                if( !visit[i] )
                {
                    visit[i] = true;
                    queue[++rear] = i;
                }
            }
        }
        front++;
    }
    return 0;
}