图的存储

以下存取方式均为带权图

一、邻接矩阵

#include <bits/stdc++.h>
using namespace std;

int n,m,a[1000][1000],x,y,c;
int main()
{
    scanf("%d%d",&n,&m);
    memset(a,0,sizeof(a)); //默认没有边
    for (int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        a[x][y]=c;
     } 
    for (int i=1;i<=n;i++)
    {
        for (int j=1;j<=n;j++) printf("%d ",a[i][j]);
        printf("
"); 
    }
    return 0;
 } 

二、邻接链表

#include <bits/stdc++.h>
using namespace std;

const int maxn=1000;
const int maxm=10000;
struct Edge
{
    int x,y,next,c;
}edge[maxm*2];
int sumedge,head[maxn],x,y,c,n,m;
int insedge(int x,int y,int c)
{
    sumedge++;
    edge[sumedge].x=x;
    edge[sumedge].y=y;
    edge[sumedge].next=head[x];
    edge[sumedge].c=c;
    head[x]=sumedge;
    return 0;
}
int main()
{
    scanf("%d%d",&n,&m);
    sumedge=0;
    memset(head,0,sizeof(head));
    for (int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        insedge(x,y,c);
        insedge(y,x,c); 
     } 
    return 0;
 }