C# (CSharp) Pathfindax.Algorithms DijkstraAlgorithm Beispiele

Beispiel #1

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

Beispiel #2

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