第五周作业——有向图邻接表表示及反向图构造

#include <iostream>
#include "stdafx.h"
#include <fstream>
#include <string.h>

using namespace std;

#define  MATRIX_SIZE 44		//存放txt文档数据的数组长度为22*2 = 44
#define  VERTEX_NUM 13		//图的顶点数为13
#define  EGDE_NUM 22			//边的数目为13


void getDataFromFile(const char *filename,int *data)			//将txt文档的数字存入data数组
{
	ifstream fin;
	int index = 0;
	fin.open(filename, ios::in);
	if (!fin)
	{
		cerr << "the fucking file openning failed!" << endl;
		exit(1);
	}

	//忽略读入顶点数和边数
	fin.ignore(5,'/n');												

	while(!fin.eof())						
	{
		fin >> data[index++];
	}

	fin.close();
	//return index;
}

void writeToFile(const char * fileneme, int tem_array[VERTEX_NUM][VERTEX_NUM], int index)			//将排序好的数组数据写入新的txt文档
{
	fstream datafile;
	datafile.open(fileneme, ios::out|ios::trunc);
	if (!datafile)
	{
		cerr << "file open failed!" << endl;
		exit(1);
	}
	for (int i = 0; i < index; i ++)
	{
		for (int j = 0; j < index; j ++)
		{
			datafile << tem_array[i][j];
		}
	}
	datafile.close();
}

//template <class DataType>
class GraphReverse
{
public:
	GraphReverse(int array[], int v, int e);
	~GraphReverse(){};

	void pullMatrix(int array[]);				//对邻接矩阵数组填充1
	void printMatrix(int array[]);							//打印邻接矩阵数组
	void getMatrix(int  tem_array[VERTEX_NUM][VERTEX_NUM]);
	void createReverseGraph(int array[]);				//构建反向图
private:
	int vertexNum, egdeNum;
	int adj_matrix[VERTEX_NUM][VERTEX_NUM];
	int vertex[VERTEX_NUM];
	//int egde[EGDE_NUM][EGDE_NUM];
};

GraphReverse::GraphReverse(int array[], int v, int e)
{
	vertexNum = v;
	egdeNum = e;

	for (int i = 0; i < VERTEX_NUM; i ++)						//初始化邻接矩阵数组
	{	for (int j = 0; j < VERTEX_NUM; j ++)
	{
		adj_matrix[i][j] = 0;
	}
	}

	for (int i = 0; i < VERTEX_NUM; i ++)
	{
		vertex[i] = i;
	}
	

}

void GraphReverse::pullMatrix(int array[])
{
	int a = 0,b = 0;
	for (int i = 0; i < MATRIX_SIZE; i = i +2)
	{
		a = array[i];
		b = array[i + 1];
		adj_matrix[a][b] = 1;
	}
}

void GraphReverse::printMatrix(int array[])
{
	for (int i = 0; i < VERTEX_NUM; i ++)
	{
		cout << i << ": " ;
		for (int j = 0; j < MATRIX_SIZE; j = j + 2)
		{
			if (array[j] == i)
			{
				cout << array[j + 1] << "  ";
			}
		}
		cout << endl;
	}

}

void GraphReverse::getMatrix(int  tem_array[VERTEX_NUM][VERTEX_NUM])
{
	for (int i = 0; i < VERTEX_NUM; i ++)
	{
		for (int j = 0; j < VERTEX_NUM; j ++)
		{
			tem_array[i][j] = adj_matrix[i][j];
		}
	}

}

void GraphReverse::createReverseGraph(int array[])
{
	int tem = 0;
	for (int i = 0; i < MATRIX_SIZE; i = i + 2)
	{
		tem = array[i];
		array[i] = array[i + 1];
		array[i + 1] = tem;
	}
	
}

int main()
{
	int * data = new int[MATRIX_SIZE];
	int adj_tem_matrix[VERTEX_NUM][VERTEX_NUM];
	getDataFromFile("tinyDG.txt", data);
	GraphReverse mGraph(data, VERTEX_NUM, EGDE_NUM);

	mGraph.pullMatrix(data);
	cout << "the adjacency list is:" << endl;
	mGraph.printMatrix(data);

	cout << "the adjacency list of resverse graph is:" << endl;
	mGraph.createReverseGraph(data);
	mGraph.printMatrix(data);
	//mGraph.getMatrix(adj_tem_matrix);
	//writeToFile("tinyG_matrix.txt", adj_tem_matrix,  matrix_num);		
	delete []data;	
	return 0;
}