Class Greedy

Convenience methods for the Greedy<T> graph solver.

Inheritance

System.Object

Greedy

Namespace: PathFinder.Solvers.Generic

Assembly: PathFinder.dll

Syntax

public static class Greedy : object

Methods

Solve<T>(T, T, out IList<T>, INodeTraverser<T>, Int32)

Finds a path between the origin and destination node.

Declaration

public static SolverState Solve<T>(T origin, T destination, out IList<T> path, INodeTraverser<T> traverser = null, int maxTicks = 1000000)
    where T : IEquatable<T>

Parameters

Type	Name	Description
T	origin	Origin
T	destination	Destination
IList<T>	path	The resulting path if Success, otherwise null
INodeTraverser<T>	traverser	The INodeTraverser<T> implementation to use when traversing the graph -or- null to use the ITraversableNode<T> implementation on each node.
System.Int32	maxTicks	The maximum number of ticks to run before failing.

Returns

Type	Description
SolverState	The SolverState of the solver after running.

Type Parameters

Name	Description
T	The type of nodes to traverse. Must extend ITraversableNode<T> if traverser is null.