Inheritance diagram for VRage.Algorithms.IMyPathVertex< V >:
Public Member Functions | |
| float | EstimateDistanceTo (IMyPathVertex< V > other) |
| Heuristic on the shortest path to another vertex. Used for finding the shortest path. More... | |
| int | GetNeighborCount () |
| Returns the number of neighbouring vertices. More... | |
| IMyPathVertex< V > | GetNeighbor (int index) |
| Gets N-th neighbor of this vertex. Must be consistent with the order in which IEnumerable<IMyPathEdge<V>> traverses the neighbors More... | |
| IMyPathEdge< V > | GetEdge (int index) |
| Gets N-th edge of this vertex. Must be consistent with the GetNeighbor() function. More... | |
Properties | |
| MyPathfindingData | PathfindingData [get] |
Detailed Description
Definition at line 8 of file IMyPathVertex.cs.
Member Function Documentation
| float VRage.Algorithms.IMyPathVertex< V >.EstimateDistanceTo | ( | IMyPathVertex< V > | other | ) |
Heuristic on the shortest path to another vertex. Used for finding the shortest path.
| IMyPathEdge<V> VRage.Algorithms.IMyPathVertex< V >.GetEdge | ( | int | index | ) |
Gets N-th edge of this vertex. Must be consistent with the GetNeighbor() function.
| IMyPathVertex<V> VRage.Algorithms.IMyPathVertex< V >.GetNeighbor | ( | int | index | ) |
Gets N-th neighbor of this vertex. Must be consistent with the order in which IEnumerable<IMyPathEdge<V>> traverses the neighbors
| int VRage.Algorithms.IMyPathVertex< V >.GetNeighborCount | ( | ) |
Returns the number of neighbouring vertices.
Property Documentation
|
get |
Definition at line 10 of file IMyPathVertex.cs.
The documentation for this interface was generated from the following file:
- Sources/VRage.Library/Algorithms/IMyPathVertex.cs
