메소드 | 설명 | |
---|---|---|
Add ( Point point, Node parent, int realCost, int heuristicCost ) : void |
Adds node to fringe only if it is not already in fringe or it's cheaper (then old node is rewritten)
|
|
Clear ( ) : void | ||
DataPool ( int capacity ) : System.Collections.Generic | ||
GetBestNode ( ) : Node | ||
RemoveFromFringe ( Node node ) : void |
public Add ( Point point, Node parent, int realCost, int heuristicCost ) : void | ||
point | Point | point of the path |
parent | Node | parent node |
realCost | int | real cost to this node |
heuristicCost | int | heuristic cost to target node |
리턴 | void |
public DataPool ( int capacity ) : System.Collections.Generic | ||
capacity | int | |
리턴 | System.Collections.Generic |