链式前向星+dijkstra 使用链式前向星也可避免图中重边的问题

//无向图 链式前向星
#include 
using namespace std;
const int maxv=100+5;
const int maxe=10000+5;
struct Edge{
int next,to,weight;
};
Edge edges[maxe];
int head[maxv],v,e,cnt;
void add(int u,int V,int dist)
{
    edges[++cnt].next=head[u];
    edges[cnt].to=V;
    edges[cnt].weight=dist;
    head[u]=cnt;
    edges[++cnt].next=head[V];
    edges[cnt].to=u;
    edges[cnt].weight=dist;
    head[V]=cnt;
}
int main()
{
    cnt=0;
    memset(head,0,sizeof(head));
    scanf("%d%d",&v,&e);
    for(int i=0;i0)
    {
        for(int i=head[d];i!=0;i=edges[i].next)
            cout<"<

链式前向星+dijkstra

//使用链式前向星实现dijkstra,使用链式前向星也可避免图中重边的问题
#include
using namespace std;
typedef pairPII;
const int maxv=1000+5;
const int maxe=10000+5;
const int INF=0x3f3f3f3f;
struct Edge{
int next,to,weight;
};
Edge edges[maxe];
int d[maxv],head[maxv],v,e,cnt,st=1,en;
bool done[maxv];
//无向图
void add(int u,int V,int dist)
{
    edges[++cnt].next=head[u];
    edges[cnt].to=V;
    edges[cnt].weight=dist;
    head[u]=cnt;
    edges[++cnt].next=head[V];
    edges[cnt].to=u;
    edges[cnt].weight=dist;
    head[V]=cnt;
}
void dijkstra()
{
    memset(done,false,sizeof(done));
    memset(d,INF,sizeof(d));
    d[st]=0;
    priority_queue,greater >pq;
    while(!pq.empty()) pq.pop();
    pq.push(PII(d[st],st));
    while(!pq.empty())
    {
        PII k=pq.top();
        pq.pop();
        if(en==k.second) return;
        if(done[k.second]) continue;
        done[k.second]=true;
        for(int i=head[k.second];i!=0;i=edges[i].next)
        {
            if(k.first+edges[i].weight