多个起点多个终点的最短路模板

void spfa()
{
     
    int scnt;
    scanf("%d", &scnt);

    memset(dist, 0x3f, sizeof dist);

    int hh = 0, tt = 0;
    while (scnt -- )//从虚拟原点到每一个起点都连一条边
    {
     
        int u;
        scanf("%d", &u);
        dist[u] = 0;
        q[tt ++ ] = u;
        st[u] = true;
    }

    while (hh != tt)
    {
     
        int t = q[hh ++ ];
        if (hh == N) hh = 0;

        st[t] = false;
        for (int i = h[t]; ~i; i = ne[i])
        {
     
            int j = e[i];
            if (dist[j] > dist[t] + w[i])
            {
     
                dist[j] = dist[t] + w[i];
                if (!st[j])
                {
     
                    q[tt ++ ] = j;
                    if (tt == N) tt = 0;
                    st[j] = true;
                }
            }
        }
    }
}