最短路：正向建图，反向建图

---

正向建图，反向建图

---

HDU - 1535 Invitation Cards

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <bitset>
#include <vector>
#include<cstring>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
inline int read(){int s=0,w=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();return s*w;}
const int maxn = 1e6+5;
int n,t;
int head[maxn],tot;
ll dis[maxn];
bool vis[maxn];
struct Edge{
    int to,next;
    int val;
}edge[maxn<<2];
struct node{
    ll dis;
    int pos;
    bool operator<(const node &x)const {
        return x.dis<dis;
    }
};
void add_edge(int u,int v,int w){
    edge[tot].to=v;
    edge[tot].next=head[u];
    edge[tot].val=w;
    head[u]=tot++;
}
void Dijskra(int s)
{
    memset(vis,false,sizeof(vis));
    memset(dis,INF,sizeof(dis));
    priority_queue<node>q;
    q.push({0,s});
    dis[s]=0;
    while (!q.empty())
    {
        int x=q.top().pos; q.pop();
        if(vis[x]) continue; vis[x]=true;
        for(int i=head[x];i!=-1;i=edge[i].next){
            int y=edge[i].to;
            if(dis[y]>dis[x]+edge[i].val){
                dis[y]=dis[x]+edge[i].val;
                if(!vis[y]) q.push({dis[y],y});
            }
        }
    }
}
int u[maxn],v[maxn],w[maxn];
int main()
{
    int t=read();
    while (t--){
        tot=0;
        memset(head,-1,sizeof(head));
        int n=read(),m=read();
        for(int i=1;i<=m;i++){
            u[i]=read(),v[i]=read(),w[i]=read();
            add_edge(u[i],v[i],w[i]);
        }

        Dijskra(1);

        ll ans=0;

        for(int i=2;i<=n;i++) ans+=dis[i];

        tot=0;
        memset(head,-1,sizeof(head));
        for(int i=1;i<=m;i++)
            add_edge(v[i],u[i],w[i]);

        Dijskra(1);

        for(int i=2;i<=n;i++) ans+=dis[i];

        printf("%lld\n",ans);
    }
    return 0;
}