【图论】【vector】用vector存储图的邻接矩阵

#include
#include
#define MAXN 50
using namespace std;

struct edge{
	int to,cost;
};
vector G[MAXN];
int V,E;
int temp1;

int main()
{
	cin >> V >> E;
	for(int i=0;i> temp1 >> e.to >> e.cost ;	//分别表示其起点、终点、路程
		G[temp1].push_back(e);	//压入vector 
	}
	
	
	for(int i=1;i<=V;i++)
	{
		for(int j=0;j

测试输入：

3 8
1 3 9
2 1 6
1 2 4
2 3 9
2 1 5
3 1 6
3 2 5
1 2 6

测试输出：

from 1 to 3,the cost is 9
from 1 to 2,the cost is 4
from 1 to 2,the cost is 6
from 2 to 1,the cost is 6
from 2 to 3,the cost is 9
from 2 to 1,the cost is 5
from 3 to 1,the cost is 6
from 3 to 2,the cost is 5