Class AStarSearch
Provides an implementation of the A* search algorithm. This class cannot be inherited.
Inherited Members
Namespace: Rebus.Server
Assembly: Rebus.Server.dll
Syntax
public static class AStarSearch
Remarks
The implementation of this class was inspired by and based on this Wikipedia article.
Methods
Search<T>(T, T, IFunctions<T>)
Finds the shortest path between two nodes.
Declaration
public static Stack<T> Search<T>(T source, T destination, IFunctions<T> functions)
where T : IEquatable<T>
Parameters
| Type | Name | Description |
|---|---|---|
| T | source | The source node. |
| T | destination | The destination node. |
| IFunctions<T> | functions | The set of graph-node functions. |
Returns
| Type | Description |
|---|---|
| Stack<T> | A stack containing the ordered set of nodes leading from the |
Type Parameters
| Name | Description |
|---|---|
| T |