public AStarModified(IGraph graph, IEndPoints endPoints, IStepRule stepRule, IHeuristic function)
: base(graph, endPoints, stepRule, function)
{
PercentOfFarthestVerticesToDelete
= CalculatePercentOfFarthestVerticesToDelete;
deletedVertices = new Queue <IVertex>();
}
public GraphPath(ParentVertices parentVertices,
IEndPoints endPoints, IGraph graph, IStepRule stepRule)
{
this.parentVertices = parentVertices;
this.graph = graph;
this.endPoints = endPoints;
this.stepRule = stepRule;
}
public GraphPath(ParentVertices parentVertices,
IEndPoints endPoints, IGraph graph, IStepRule stepRule)
{
path = new Lazy <IVertex[]>(GetPath);
pathCost = new Lazy <double>(ExtractPathCost);
pathLength = new Lazy <int>(GetPathLength);
this.parentVertices = parentVertices;
this.graph = graph;
this.endPoints = endPoints;
this.stepRule = stepRule;
}
public WalkStepRule(IStepRule stepRule)
{
this.stepRule = stepRule;
}
public AStarAlgorithm(IGraph graph, IEndPoints endPoints, IStepRule stepRule)
: this(graph, endPoints, stepRule, new ChebyshevDistance())
{
}
public AStarAlgorithm(IGraph graph, IEndPoints endPoints, IStepRule stepRule, IHeuristic function)
: base(graph, endPoints, stepRule)
{
heuristic = function;
}
public CostGreedyAlgorithm(IGraph graph, IEndPoints endPoints, IStepRule stepRule)
: base(graph, endPoints)
{
this.stepRule = stepRule;
}
public AStarModified(IGraph graph, IEndPoints endPoints, IStepRule stepRule)
: base(graph, endPoints, stepRule, new ChebyshevDistance())
{
}
public DijkstraAlgorithm(IGraph graph, IEndPoints endPoints, IStepRule stepRule)
: base(graph, endPoints)
{
this.stepRule = stepRule;
}
public WalkStepRule(IStepRule stepRule, int walkStepCost = 1)
{
this.stepRule = stepRule;
this.walkStepCost = walkStepCost;
}
public DiagonalExpensiveStepRule(IStepRule stepRule)
{
this.stepRule = stepRule;
}
