void Graph::DFS_Visit(vertex_struct aVertex)
{
	aVertex.Color = "GRAY";
	mTime = mTime + 1;
	aVertex.Dist = mTime;
	for (list<vertex_struct *>::iterator it = aVertex.Edges.begin(); it != aVertex.Edges.end(); it++)
	{
		if(it->Color.compare("WHITE") == 0)
		{
			it->Pred = &aVertex;
			DFS_Visit(&it);
		}

		aVertex.Color = "BLACK";
		aVertex.Finish = mTime;
		mStack.push(aVertex);
		mTime = mTime + 1;
	}
}

void Graph::DFS(list<vertex_struct> aGraph)
{

	// Initialize Color and predecessors (leave Pred blank):
	for(list<vertex_struct>::iterator init = aGraph.begin(); init != aGraph.end(); init++)
	{
		init->Color = "WHITE";
		init->Pred = NULL;
	}

	mTime = 0;

	for(list<vertex_struct>::iterator it = aGraph.begin(); it != aGraph.end(); it++)
	{
		if(it->Color.compare("WHITE") == 0)
		{
			DFS_Visit(*it);
		}
	}
}

//Vertex
typedef struct vertex_struct {
	string Name;
	list<vertex_struct *> Edges;
	float Delay;
	string Color;
	vertex_struct *Pred;
	float Dist;
	int Finish;

};