C#深さ優先探索アルゴリズムdemo
7008 ワード
// , demo
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace DFS
{
class Program
{
public int[,] map = new int[100, 100];
public int[] road = new int[120];
public int n, x, y;
public int m = 1;
public int[] visited = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, };
static void Main(string[] args)
{
Program pro = new DFS.Program();
int i, j;
pro.n = int.Parse(Console.ReadLine());
pro.x= int.Parse(Console.ReadLine());
pro.y= int.Parse(Console.ReadLine());
for (i = 0; i < pro.n; i++)
{
for (j = 0; j < pro.n; j++)
{
pro.map[i,j]= int.Parse(Console.ReadLine());
}
}
pro.road[0] = pro.x;
pro.dfs(pro.x);
}
public void dfs(int p)
{
visited[p] = 1;
int i, j;
for (i = 0; i < n; i++)
{
if (map[p,i] == 1 && visited[i] == 0)
{
if (i == y)/// ,
{
for (j = 0; j < m; j++)
{
Console.WriteLine("{0}", road[j]);
}
Console.WriteLine("{0}\r
", y);
}
else///
{
map[p,i] = 0;
road[m] = i;///
m++;
dfs(i);///
map[p,i] = 1;
visited[i] = 0;
m--;
}
}
}
}
}
}
転載先:https://www.cnblogs.com/Traveller-Lee/p/7068222.html