private void btnStart_Click(object sender, EventArgs e)
{
foreach (var cellGridControl in CellGrid.Controls)
{
var btn = (CellButton)cellGridControl;
btn.SetUnmarked();
}
IEnumerable <CellNode> path = null;
switch (cbAlgorithm.SelectedIndex)
{
case 0:
path = _graph.AStar(0, 0, _graph.X - 1, _graph.Y - 1);
break;
case 1:
path = _graph.Dijkstra(0, 0, _graph.X - 1, _graph.Y - 1);
break;
default:
path = _graph.AStar(0, 0, _graph.X - 1, _graph.Y - 1);
break;
}
if (path == null)
{
return;
}
foreach (var cellNode in path)
{
_grid[cellNode.X, cellNode.Y].SetMarked();
}
}
public static void Main(string[] args)
{
int x = 70, y = 70;
int sx = 0, sy = 0;
int ex = x - 1, ey = y - 1;
GridGraph graph = new GridGraph(x, y);
graph.SetCell(4, 0, true);
graph.SetCell(4, 1, true);
graph.SetCell(4, 2, true);
graph.SetCell(4, 3, true);
graph.SetCell(4, 4, false);
graph.SetCell(4, 5, true);
graph.SetCell(4, 6, true);
graph.SetCell(4, 7, true);
graph.SetCell(4, 8, true);
graph.SetCell(4, 9, true);
ICollection <CellNode> path = graph.AStar(sx, sy, ex, ey);
if (path == null)
{
Console.Out.WriteLine("Could not find path");
return;
}
char[,] map = new char[x, y];
for (int i = 0; i < x; i++)
{
for (int j = 0; j < y; j++)
{
map[i, j] = graph.GetCell(i, j) ? '█' : '▒';
}
}
foreach (var cellNode in path)
{
map[cellNode.X, cellNode.Y] = '*';
}
map[sx, sy] = 'S';
map[ex, ey] = 'E';
Console.Out.WriteLine("Result:");
for (int i = 0; i < x; i++)
{
for (int j = 0; j < y; j++)
{
Console.Write(map[i, j]);
}
Console.WriteLine();
}
}
public void StartAStar(int sx, int sy, int ex, int ey)
{
IEnumerable <CellNode> path = _graph.AStar(sx, sy, ex, ey);
}
