메소드 | 설명 | |
---|---|---|
clearInstrumentation ( ) : void | ||
getMaxQueueSize ( ) : int | ||
getPathCost ( ) : double | ||
getQueueSize ( ) : int | ||
getResultingNodesToAddToFrontier ( |
||
isCheckGoalBeforeAddingToFrontier ( ) : bool | ||
isFailure ( List |
||
popNodeFromFrontier ( ) : |
||
removeNodeFromFrontier ( |
||
search ( |
||
setCheckGoalBeforeAddingToFrontier ( bool checkGoalBeforeAddingToFrontier ) : void | ||
setPathCost ( double pathCost ) : void | ||
setQueueSize ( int queueSize ) : void |
메소드 | 설명 | |
---|---|---|
failure ( ) : List |
public abstract getResultingNodesToAddToFrontier ( |
||
nodeToExpand | ||
p | ||
리턴 | List |
public isCheckGoalBeforeAddingToFrontier ( ) : bool | ||
리턴 | bool |
public removeNodeFromFrontier ( |
||
toRemove | ||
리턴 | bool |
public search ( |
||
problem | ||
frontier | Queue |
|
리턴 | List |
public setCheckGoalBeforeAddingToFrontier ( bool checkGoalBeforeAddingToFrontier ) : void | ||
checkGoalBeforeAddingToFrontier | bool | |
리턴 | void |