PathCost

#include "stdafx.h"
#include <iostream>
#include <iomanip>
using namespace std;
#define size 7
#define dis 9999999
int GraphMatrix[size][size];

void BuildMatrix(int*PathCost)
{
	int StartPoint;
	int EndPoint;
	int i, j;
	for (i = 1; i < size; i++)
	{
		for (j = 1; j < size; j++)
		{
			if (i == j)
				GraphMatrix[i][j] = 0;
			else
				GraphMatrix[i][j] = dis;
		}
	}

	i = 0;
	for (int i = 0; i < 12;i++)
	{
		StartPoint = PathCost[i * 3]-1;
		EndPoint = PathCost[i * 3 + 1]-1;
		GraphMatrix[StartPoint][EndPoint] = PathCost[i * 3 + 2];
		GraphMatrix[EndPoint][StartPoint] = PathCost[i * 3 + 2];
	}
}

void PrintGraph()
{
	int i, j;
	for (i = 0; i < size; i++)
	{
		cout << "vex" << i+1;
		for (j = 0; j < size; j++)
		{
			{
				if (GraphMatrix[i][j] == dis)
					cout <<setw(5)<< 'x';
				else
				{
					GraphMatrix[j][i] = GraphMatrix[i][j];
					cout << setw(5) << GraphMatrix[i][j];
				}
			}
		}
		cout << endl;
	}
}

int main(void)
{
	int PathCost[12][3] = {
		{ 1, 2, 17 },
		{ 2, 3, 6 },
		{ 3, 4, 11 },
		{ 4, 5, 19 },
		{ 5, 6, 9 },
		{ 1, 5, 20 },
		{ 1, 6, 4 },
		{ 1, 7, 24 },
		{ 2, 7, 12 },
		{ 2, 4, 8 },
		{ 4, 7, 15 },
		{ 5, 7, 32 },

	};
	BuildMatrix(&PathCost[0][0]);
	cout << "相鄰矩陣如下" << endl;
	cout << "頂點 vex1 vex2 vex3 vex4 vex5 vex6 vex7" << endl;
	PrintGraph();
}