Exemplos de Pathfindax.Algorithms DijkstraAlgorithm em C# (CSharp)

Exemplo n.º 1

 public PotentialFieldAlgorithm(int cacheSize, int amountOfNodes)
 {
     _dijkstraAlgorithm = new DijkstraAlgorithm(amountOfNodes);
     if (cacheSize > 0)
     {
         _potentialFieldCache = new ConcurrentCache <IPathRequest, PotentialField>(cacheSize, new SingleSourcePathRequestComparer());
     }
 }

Exemplo n.º 2

 public PotentialFieldAlgorithm(int amountOfNodes)
 {
     _dijkstraAlgorithm = new DijkstraAlgorithm(amountOfNodes);
 }