BiSearchNode Class Documentation#
Package: sc.fiji.snt.tracing
A SearchNode which can maintain both a from-start and from-goal search state.
Methods#
Getters Methods#
- getF(boolean)#
- getFFromGoal()#
- getFFromStart()#
- getG(boolean)#
- getGFromGoal()#
- getGFromStart()#
- getHeapHandle(boolean)#
- getHeapHandleFromGoal()#
- getHeapHandleFromStart()#
- getPredecessorFromGoal()#
- getPredecessorFromStart()#
- getState(boolean)#
- getStateFromGoal()#
- getStateFromStart()#
- getX()#
- getY()#
- getZ()#
Setters Methods#
- setFFromGoal(double)#
- setFFromStart(double)#
- setFrom(double, double, BiSearchNode, boolean)#
- setFromGoal(double, double, BiSearchNode)#
- setFromStart(double, double, BiSearchNode)#
- setGFromGoal(double)#
- setGFromStart(double)#
- setHeapHandle(AddressableHeap$Handle, boolean)#
- setHeapHandleFromGoal(AddressableHeap$Handle)#
- setHeapHandleFromStart(AddressableHeap$Handle)#
- setPosition(int, int, int)#
- setPredecessorFromGoal(BiSearchNode)#
- setPredecessorFromStart(BiSearchNode)#
- setState(BiSearchNode$State, boolean)#
- setStateFromGoal(BiSearchNode$State)#
- setStateFromStart(BiSearchNode$State)#
- setX(int)#
- setY(int)#
- setZ(int)#
Other Methods#
- heapDecreaseKey(boolean)#
- heapInsert(AddressableHeap, boolean)#