链式前向星|前向星|STL中vector模拟链表（图的存储)
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 1000;const int maxm = 1000000;int n, m;int head[maxn];int num = 1;/*链式前向星 */struct node { int to; int next; int w;};node edge[maxm];void output_map() { for(int i = 1; i <= n; i++) { for(int k = head[i]; k != -1; k = edge[k].next) { printf("%d->%d w = %d\n", i, edge[k].to, edge[k].w); } }}void init() { memset(head, -1, sizeof(head)); num = 1;}int main(){ int a, b, w; while(scanf("%d%d", &n, &m) != EOF) { init(); for(int i = 1; i <= m; i++) { scanf("%d%d%d", &a, &b, &w); edge[num].to = b; edge[num].w = w; edge[num].next = head[a]; head[a] = num; num++; } output_map(); } return 0;}/* 前向星 */#include <iostream>#include <cstdio>#include <queue>#include <cstring>#include <algorithm>using namespace std;const int INF = 0x7fffffff;const int maxn = 1000;const int maxm = 1000000;int head[maxn];int n, m;///the numbers of edges and pointstruct node{ int from; int to; int w;};node edge[maxn];//边bool cmp(node a, node b) { if(a.from == b.from && a.to == b.to) { return a.w < b.w; } if(a.from == b.from) { return a.to < b.to; } return a.from < b.from;}int main(){ cin >> n >> m; for(int i = 1; i <= m; i++) { cin >> edge[i].from >> edge[i].to >> edge[i].w; } sort(edge+1, edge+m+1, cmp); memset(head, -1, sizeof(head));///init head[]; for(int i = 1; i <= m; i++) { if(edge[i].from != edge[i-1].from) {///judge if the neibor edges has the same beginning point head[edge[i].from] = i;///确定起点为Vi的第一条边的位置。 } } for(int i = 1; i <= n; i++) { for(int k = head[i]; edge[k].from== i && k <= m; k++) { cout << edge[k].from << ' ' << edge[k].to << ' ' << edge[k].w << endl; } } return 0;}/* vector模拟链表 */#include <iostream>#include <cstdio>#include <queue>#include <cstring>#include <algorithm>#include <vector>using namespace std;const int maxn = 1000;const int maxm = 1000000;struct node { int to; int w;};int n, m;vector<node> a[maxn];void output() { vector<node>::iterator k; for(int i = 1; i <= n; i++) { for(k = a[i].begin(); k != a[i].end(); k++) { node tmp = *k; cout << i << ' ' << tmp.to << ' ' << tmp.w << endl; } }}int main(){ int n, m; node e; int i, j, w; for(int i = 1; i<= m; i++) { cin >> i >> j >> w; e.to = j; e.w = w; a[i].push_back(e); } output(); return 0;}/***************************测试样例：5 81 2 21 3 32 4 72 5 123 5 104 5 93 2 63 4 1喜爱编程的朋友加油！***********************/