|
| | MyPathFindingSystem (int queueInitSize=128, Func< long > timestampFunction=null) |
| |
| MyPath< V > | FindPath (V start, V end, Predicate< V > vertexTraversable=null, Predicate< IMyPathEdge< V >> edgeTraversable=null) |
| |
| MyPath< V > | FindPath (V start, Func< V, float > heuristic, Func< V, float > terminationCriterion, Predicate< V > vertexTraversable=null, bool returnClosest=true) |
| |
| bool | Reachable (V from, V to) |
| |
| void | FindReachable (IEnumerable< V > fromSet, List< V > reachableVertices, Predicate< V > vertexFilter=null, Predicate< V > vertexTraversable=null, Predicate< IMyPathEdge< V >> edgeTraversable=null) |
| |
| void | FindReachable (V from, List< V > reachableVertices, Predicate< V > vertexFilter=null, Predicate< V > vertexTraversable=null, Predicate< IMyPathEdge< V >> edgeTraversable=null) |
| |
| long | GetCurrentTimestamp () |
| |
| bool | VisitedBetween (V vertex, long start, long end) |
| |
| void | PrepareTraversal (V startingVertex, Predicate< V > vertexFilter=null, Predicate< V > vertexTraversable=null, Predicate< IMyPathEdge< V >> edgeTraversable=null) |
| | Has to be called before any traversal of the pathfinding system using enumerators. More...
|
| |
| void | PerformTraversal () |
| |
| IEnumerator< V > | GetEnumerator () |
| |
Definition at line 10 of file MyPathFindingSystem.cs.
| void VRage.Algorithms.MyPathFindingSystem< V >.FindReachable |
( |
IEnumerable< V > |
fromSet, |
|
|
List< V > |
reachableVertices, |
|
|
Predicate< V > |
vertexFilter = null, |
|
|
Predicate< V > |
vertexTraversable = null, |
|
|
Predicate< IMyPathEdge< V >> |
edgeTraversable = null |
|
) |
| |
|
inline |
Has to be called before any traversal of the pathfinding system using enumerators.
Several predicates can be supplied to the system that change the behavior of the traversal.
- Parameters
-
| startingVertex | The vertex from which the traversal starts |
| vertexFilter | If set, this predicate is applied to the output vertices so that we only get those that we are interested in. |
| vertexTraversable | This predicate allows to make vertices of the graph untraversable, blocking the paths through them. It is guaranteed to be called only once on every vertex when enumerating the graph or finding reachable vertices, but for pathfinding functions, this guarantee is no longer valid. |
| edgeTraversable | This predicate allows to make edges untraversable, blocking the paths through them. |
Definition at line 425 of file MyPathFindingSystem.cs.
The documentation for this class was generated from the following file:
