数据结构——STL实现邻接表输入与打印

按照之前没用STL的那个改了一下，直接给出代码：

#include<iostream>
#include<vector>
#define maxn 1000
using namespace std;

struct node
{
	int adjvex;
	char data;
	int weight;
};

vector<node> adj[maxn];
bool visited[maxn] = { false };
int n;

void createNode(char a,int i,int w=0)
{
	node temp;
	temp.adjvex = a-'a';
	temp.data = a;
	temp.weight = w;
	adj[i].push_back(temp);
}

void create()
{
	int m;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
	{
		char tempA;
		cin >> tempA;
		createNode(tempA, i);
	}
	char a, b;
	int cost,aa,bb;
	for (int i = 0; i < m; i++)
	{
		cin >> a >> b >> cost;
		for (int j = 0; j < n; j++)
		{
			if (a == adj[j][0].data)
				aa = adj[j][0].adjvex;
		}
		createNode(b, aa, cost);
	}
}

void print()
{
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < adj[i].size(); j++)
		{
			cout << adj[i][j].data <<adj[i][j].weight << ' ';
		}
		cout << endl;
	}
}

int main(void)
{
	create();
	print();
	system("pause");
	return 0;
}

接着是测试图：