Shortest template (continually updated)

Shortest topics (continually updated)

\ (1. \) \ (Silver \) \ (Cow \) \ (Party \) (need to read this blog post code)

Non-negative weights single source shortest path

void dijkstra(int s)
{
    memset(dis,0x3f,sizeof(dis));
    memset(vis,0,sizeof(vis));
    priority_queue<pair<int,int> > q;
    dis[s]=0;
    q.push(make_pair(0,s));
    while(!q.empty())
    {
        int x=q.top().second;
        q.pop();
        if(vis[x])
                continue;
        vis[x]=1;
        for(register int i=head[x];i;i=e[i].nxt)
        {
            int y=e[i].ver,w=e[i].w;
            if(dis[y]>dis[x]+w)
            {
                dis[y]=dis[x]+w;
                q.push(make_pair(-dis[y],y));
            }
        }
    }
}