java 递归 dfs,迭代DFS与递归DFS和不同元素顺序

下面是C＃for Adjacency Matrix中的示例代码(根据上面的@amit回答) .

using System;

using System.Collections.Generic;

namespace GraphAdjMatrixDemo

{

public class Program

{

public static void Main(string[] args)

{

// 0 1 2 3 4 5 6

int[,] matrix = { {0, 1, 1, 0, 0, 0, 0},

{1, 0, 0, 1, 1, 1, 0},

{1, 0, 0, 0, 0, 0, 1},

{0, 1, 0, 0, 0, 0, 1},

{0, 1, 0, 0, 0, 0, 1},

{0, 1, 0, 0, 0, 0 ,0},

{0, 0, 1, 1, 1, 0, 0} };

bool[] visitMatrix = new bool[matrix.GetLength(0)];

Program ghDemo = new Program();

for (int lpRCnt = 0; lpRCnt < matrix.GetLength(0); lpRCnt++)

{

for (int lpCCnt = 0; lpCCnt < matrix.GetLength(1); lpCCnt++)

{

Console.Write(string.Format(" {0} ", matrix[lpRCnt, lpCCnt]));

}

Console.WriteLine();

}

Console.Write("\nDFS Recursive : ");

ghDemo.DftRecursive(matrix, visitMatrix, 0);

Console.Write("\nDFS Iterative : ");

ghDemo.DftIterative(matrix, 0);

Console.Read();

}

//====================================================================================================================================

public void DftRecursive(int[,] srcMatrix, bool[] visitMatrix, int vertex)

{

visitMatrix[vertex] = true;

Console.Write(vertex + " ");

for (int neighbour = 0; neighbour < srcMatrix.GetLength(0); neighbour++)

{

if (visitMatrix[neighbour] == false && srcMatrix[vertex, neighbour] == 1)

{

DftRecursive(srcMatrix, visitMatrix, neighbour);

}

}

}

public void DftIterative(int[,] srcMatrix, int srcVertex)

{

bool[] visited = new bool[srcMatrix.GetLength(0)];

Stack vertexStack = new Stack();

vertexStack.Push(srcVertex);

while (vertexStack.Count > 0)

{

int vertex = vertexStack.Pop();

if (visited[vertex])

continue;

Console.Write(vertex + " ");

visited[vertex] = true;

for (int neighbour = srcMatrix.GetLength(0) - 1; neighbour >= 0; neighbour--)

//for (int neighbour = 0; neighbour < srcMatrix.GetLength(0); neighbour++)

{

if (srcMatrix[vertex, neighbour] == 1 && visited[neighbour] == false)

{

vertexStack.Push(neighbour);

}

}

}

}

}

}