图的STL邻接表表示

#include<iostream>

#include <cstdio>

#include <vector>

using namespace std;

const int maxn = 1000;

int i, j, w;

int main()

{

//邻接表

//STL模板实现

struct edgenode

{

int to;

int w;

};

vector<edgenode>map[maxn];

//输入

for (int m = 0; m < size; m++)

{

edgenode e;

cin >> i >> j >> w;

e.to = j;

e.w = w;

map[i].push_back(e);

}

//遍历

for (int i = 0; i < size;i++)

{

for (vector<edgenode>::iterator k = map[i].begin(); k != map[i].end(); k++)

{

edgenode t = *k;

cout << i << " " << t.to << " " << t.w << endl;

}

}

return 0;

}