第四周作业——有向无环图的判断【未完成

用设置visited 数组的方法判断环正确，但是输出环路径的时候一直有问题，请问应该怎么改？

#include <iostream>
#include "stdafx.h"
#include <fstream>
#include <vector>
#include <string.h>
using namespace std;

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

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

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

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

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

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

	void transMatrix(int * array);
	void printMatrix();														//打印邻接矩阵数组
	//void findCirPath(int curPoint, int judgePoint);				//找出可能是环的路径
	void printCircle(int bndVertex);									//输出curPoint顶点所开始的环的路径
	void dfsGraph();															//对全图进行深度优先遍历
	void dfsAdjVertex(int index);										//对index顶点的邻接顶点深度优先遍历

private:
	int vertexNum, egdeNum;
	int adj_matrix[VERTEX_NUM][VERTEX_NUM];
	int vertex[VERTEX_NUM];
	int visited[VERTEX_NUM];
	vector<int> dataStack[VERTEX_NUM];
	vector<int> vStack;
	//int egde[EGDE_NUM][EGDE_NUM];
};

GraphReverse::GraphReverse(int * array, int v, int e)
{
	int vsize = VERTEX_NUM * sizeof(int);
	vertexNum = v;
	egdeNum = e;

	memset(visited, 0, vsize);

	for (int i = 0; i < VERTEX_NUM; i ++)
	{
		vertex[i] = i;				//初始化vertex数组

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

	}

}

void GraphReverse::transMatrix(int * array)
{
	int tem1 = 0;
	int tem2 = 0;
	for (int a = 0; a < MATRIX_SIZE; a = a + 2)
	{
		tem1 = array[a];  
		tem2 = array[a + 1];  
		adj_matrix[tem1][tem2] = 1;
	}

	for (int i = 0; i < VERTEX_NUM; i ++)
	{
		for (int j = 0; j < VERTEX_NUM; j ++)
		{
			if (adj_matrix[i][j] == 1)
			{			
				dataStack[i].push_back(j);			//将原数据转换到容器方便以后遍历
			}
		}
	}

}

void GraphReverse::printMatrix()
{
	cout << "circle:" << "  ";
	for (int i = vStack.size() - 1; i >= 0; i --)
	{
		cout << vStack[i] << "  ";
	}
	cout << endl;
}

/*/这个算法错
void GraphReverse::printCircle(int bndVertex)
{
	int ptr;
	vStack.push_back(bndVertex);
	for (int i = 0; i < dataStack[bndVertex].size(); i ++)
	{
		ptr = dataStack[bndVertex][i];
		if (visited[i] != 1)
		{
			if (vStack.front() == ptr)
			{
				printMatrix();
				break;
			}
			else
				printCircle(ptr);		
		}
	}
}
*/
void GraphReverse::dfsGraph()
{
	for (int i = 0; i < VERTEX_NUM; i ++)
	{
		if (visited[i] == 0)
		{
			dfsAdjVertex(i);
		}
	}
}

void GraphReverse::dfsAdjVertex(int index)
{
	int ptr;
	visited[index] = -1;
	for (int i = 0; i < dataStack[index].size(); i ++)
	{
		ptr = dataStack[index][i];
		if (visited[ptr] == 0 ) //|| (visited[ptr] == -1 && visited[ptr] != 1)) 
		{
			cout << "now visiting: " << index << "\t" << ptr << endl;
			dfsAdjVertex(ptr);
		}
		else if (visited[ptr] == -1)
		{
			cout << "now visiting -1: " << index << "\t" << ptr << endl;
			is_DAG = false;
			//printCircle(index);
		}
	}
	visited[index] = 1;					//1代表此节点及其后代都访问过了
}



int main()
{	
	int * data = new int[MATRIX_SIZE];
	getDataFromFile("tinyDG.txt", data);
	//int data[MATRIX_SIZE] = {0,1, 0,2, 5,6, 0,4, 4,3, 3,5, 0,6, 0,7, 0,8, 0,9, 0,10, 0,11, 0,12, 1,5, 1,10, 1,4, 1,5, 1,6, 1,7, 7,8, 1,9, 2,10};
	GraphReverse mGraph(data, VERTEX_NUM, EGDE_NUM);
	mGraph.transMatrix(data);

	mGraph.dfsGraph();
	if (is_DAG)
		cout << "the graph is NOT acyclic" << endl;
	else
		cout << "the graph is acyclic" << endl;

	//mGraph.printMatrix(data);
	//mGraph.getMatrix(adj_tem_matrix);
	//writeToFile("tinyG_matrix.txt", adj_tem_matrix,  matrix_num);		
	delete []data;	
	return 0;
}