|
My Project v1
Project
|
类 | |
| class | Node |
Public 成员函数 | |
| void | BuildPathFromEndNode (Node startNode, Node endNode) |
| void | FindPath (T start, T end, float minHeuristic, int maxPositionsToCheck) |
| void | HeapEnqueue (Node node) |
| Node | HeapDequeue () |
| void | HeapUpdate (Node node) |
| void | HeapifyFromPosToEnd (int pos) |
| void | HeapifyFromPosToStart (int pos) |
| Node | NewNode (T position, T previousPosition, float g, float h) |
Public 属性 | |
| int | m_nodesCacheIndex |
| DynamicArray< Node > | m_nodesCache = [] |
| DynamicArray< Node > | m_openHeap = [] |
| DynamicArray< T > | m_neighbors = [] |
属性 | |
| float | PathCost [get, set] |
| DynamicArray< T > | Path [get, set] |
| IAStarWorld< T > | World [get, set] |
| IAStarStorage< T > | OpenStorage [get, set] |
| IAStarStorage< T > | ClosedStorage [get, set] |
| void Game.AStar< T >.BuildPathFromEndNode | ( | Node | startNode, |
| Node | endNode ) |

| void Game.AStar< T >.FindPath | ( | T | start, |
| T | end, | ||
| float | minHeuristic, | ||
| int | maxPositionsToCheck ) |


| Node Game.AStar< T >.HeapDequeue | ( | ) |


| void Game.AStar< T >.HeapEnqueue | ( | Node | node | ) |


| void Game.AStar< T >.HeapifyFromPosToEnd | ( | int | pos | ) |

| void Game.AStar< T >.HeapifyFromPosToStart | ( | int | pos | ) |

| void Game.AStar< T >.HeapUpdate | ( | Node | node | ) |


| Node Game.AStar< T >.NewNode | ( | T | position, |
| T | previousPosition, | ||
| float | g, | ||
| float | h ) |

| DynamicArray<T> Game.AStar< T >.m_neighbors = [] |
| DynamicArray<Node> Game.AStar< T >.m_nodesCache = [] |
| int Game.AStar< T >.m_nodesCacheIndex |
| DynamicArray<Node> Game.AStar< T >.m_openHeap = [] |
|
getset |
|
getset |
|
getset |
|
getset |
|
getset |