private const int INFINITE_DISTANCE = 256; // simulate infinity assuming this will be greater than any Nodes's distance from any source #endregion Fields #region Constructors public DijkstraAlgorithm(Square source, ChessBoardPieceGraph graph) : base(source, graph) { //might want to initialize shortest paths to all destinations }
protected SingleSourceShortestPathStrategy(Square source, ChessBoardPieceGraph graph) { Source = source; Graph = graph; }