1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159
|
using System;
using System.Collections.Generic;
public class Dijkstra
{
private int m_nbFaces { get; set; }
private int[] m_map { get; set; }
private int[] m_pathValue { get; set; }
private int[] m_parent { get; set; }
private List<int>[] m_neighbours { get; set; }
private List<int>[] m_priority { get; set; }
public void init()
{
m_nbFaces = 19;
m_map = new int[] { 1, 6, 1, 1, 1, 6, 1, 1, 1, 1, 6, 1, 1, 6, 6, 1, 1, 1, 1 };
m_priority = new List<int>[m_nbFaces];
m_neighbours = new List<int>[m_nbFaces];
for (int i = 0; i < 19; i++)
{
m_neighbours[i] = new List<int>{};
m_priority[i] = new List<int>{};
}
m_neighbours[0].Add(1);
m_neighbours[0].Add(3);
m_neighbours[0].Add(4);
m_neighbours[1].Add(0);
m_neighbours[1].Add(2);
m_neighbours[1].Add(4);
m_neighbours[1].Add(5);
m_neighbours[2].Add(1);
m_neighbours[2].Add(5);
m_neighbours[2].Add(6);
m_neighbours[3].Add(0);
m_neighbours[3].Add(4);
m_neighbours[3].Add(7);
m_neighbours[3].Add(8);
m_neighbours[4].Add(0);
m_neighbours[4].Add(1);
m_neighbours[4].Add(3);
m_neighbours[4].Add(5);
m_neighbours[4].Add(8);
m_neighbours[4].Add(9);
m_neighbours[5].Add(1);
m_neighbours[5].Add(2);
m_neighbours[5].Add(4);
m_neighbours[5].Add(6);
m_neighbours[5].Add(9);
m_neighbours[5].Add(10);
m_neighbours[6].Add(2);
m_neighbours[6].Add(10);
m_neighbours[6].Add(11);
m_neighbours[7].Add(3);
m_neighbours[7].Add(8);
m_neighbours[7].Add(12);
m_neighbours[8].Add(3);
m_neighbours[8].Add(4);
m_neighbours[8].Add(7);
m_neighbours[8].Add(9);
m_neighbours[8].Add(12);
m_neighbours[8].Add(13);
m_neighbours[9].Add(4);
m_neighbours[9].Add(5);
m_neighbours[9].Add(8);
m_neighbours[9].Add(10);
m_neighbours[9].Add(13);
m_neighbours[9].Add(14);
m_neighbours[10].Add(5);
m_neighbours[10].Add(6);
m_neighbours[10].Add(9);
m_neighbours[10].Add(11);
m_neighbours[10].Add(14);
m_neighbours[10].Add(15);
m_neighbours[11].Add(6);
m_neighbours[11].Add(10);
m_neighbours[11].Add(15);
m_neighbours[12].Add(7);
m_neighbours[12].Add(8);
m_neighbours[12].Add(16);
m_neighbours[13].Add(8);
m_neighbours[13].Add(9);
m_neighbours[13].Add(12);
m_neighbours[13].Add(14);
m_neighbours[13].Add(16);
m_neighbours[13].Add(17);
m_neighbours[14].Add(9);
m_neighbours[14].Add(10);
m_neighbours[14].Add(13);
m_neighbours[14].Add(15);
m_neighbours[14].Add(17);
m_neighbours[14].Add(18);
m_neighbours[15].Add(10);
m_neighbours[15].Add(11);
m_neighbours[15].Add(14);
m_neighbours[15].Add(18);
m_neighbours[16].Add(12);
m_neighbours[16].Add(13);
m_neighbours[16].Add(17);
m_neighbours[17].Add(13);
m_neighbours[17].Add(14);
m_neighbours[17].Add(16);
m_neighbours[17].Add(18);
m_neighbours[18].Add(14);
m_neighbours[18].Add(15);
m_neighbours[18].Add(17);
m_pathValue = new int[m_nbFaces];
m_parent = new int[m_nbFaces];
for (int i = 0; i < m_nbFaces; i++)
{
m_pathValue[i] = 999;
m_parent[i] = -1;
}
}
public void update(int idFace)
{
int pathValue = m_pathValue[idFace];
foreach(int idNeighbour in m_neighbours[idFace])
{
Console.WriteLine(" @ " + idNeighbour);
int newPathValue = pathValue + m_map[idNeighbour];
if ( m_pathValue[idNeighbour] > newPathValue )
{
m_pathValue[idNeighbour] = newPathValue;
m_parent[idNeighbour] = idFace;
m_priority[newPathValue].Add(idNeighbour);
}
}
for (int i = 0; i < m_nbFaces; i++)
Console.WriteLine("<" + i + ">\t " + m_pathValue[i] + "\t" + m_parent[i] );
}
public Dijkstra()
{
init();
int idFace = 0;
m_pathValue[idFace] = 0;
update(idFace);
int pmmax = 10;
for(int pm = 1; pm<=pmmax; pm++)
foreach(int idFace2 in m_priority[pm])
update(idFace2);
}
}
class HelloWorld {
static void Main()
{
Console.WriteLine("Hello World");
Dijkstra dijkstra = new Dijkstra();
}
} |
Partager