void DFS( MGraph Graph, Vertex V, void (*Visit)(Vertex) )
{
Visited[V]=true;
Visit(V);
for(int i=0;i<Graph->Nv;i++)
{
if(Graph->G[V][i] == 1 && Visited[i]==false)
DFS(Graph,i,Visit);
}
}
void DFS( MGraph Graph, Vertex V, void (*Visit)(Vertex) )
{
Visited[V]=true;
Visit(V);
for(int i=0;i<Graph->Nv;i++)
{
if(Graph->G[V][i] == 1 && Visited[i]==false)
DFS(Graph,i,Visit);
}
}