/** * Provides an implementation of the {@link BoundProperty} interface to extract the cost as the bound property. * * @param searchNode The search node to extract the bound property for. * * @return The path cost of the supplied search node. The bound property to control the bounded algorithm is the * path cost. */ public float getBoundProperty(SearchNode searchNode) { return searchNode.getPathCost(); } }
/** * Provides an implementation of the {@link BoundProperty} interface to extract the cost as the bound property. * * @param searchNode The search node to extract the bound property for. * * @return The path cost of the supplied search node. The bound property to control the bounded algorithm is the * path cost. */ public float getBoundProperty(SearchNode searchNode) { return searchNode.getPathCost(); } }
/** * Provides an implementation of the {@link BoundProperty} interface to extract the cost as the bound property. * * @param searchNode The search node to extract the bound property for. * * @return The path cost of the supplied search node. The bound property to control the bounded algorithm is the * path cost. */ public float getBoundProperty(SearchNode searchNode) { return searchNode.getPathCost(); } }
/** * Compares two search nodes by their path cost. * * @param object1 The first search node to compare. * @param object2 The second search node to compare. * * @return 1 if the first node has a higher path cost than the second, -1 if it has a lower path cost and 0 if they * have the same path cost. */ public int compare(SearchNode object1, SearchNode object2) { float cost1 = object1.getPathCost(); float cost2 = object2.getPathCost(); return (cost1 > cost2) ? 1 : ((cost1 < cost2) ? -1 : 0); } }
/** * Provides an implementation of the {@link BoundProperty} interface to extract the cost as the bound property. * * @param searchNode The search node to extract the bound property for. * * @return The path cost of the supplied search node. The bound property to control the bounded algorithm is the * path cost. */ public float getBoundProperty(SearchNode searchNode) { return searchNode.getPathCost(); } }
/** * Compares two search nodes by their path cost. * * @param object1 The first search node to compare. * @param object2 The second search node to compare. * * @return 1 if the first node has a higher path cost than the second, -1 if it has a lower path cost and 0 if they * have the same path cost. */ public int compare(SearchNode object1, SearchNode object2) { float cost1 = object1.getPathCost(); float cost2 = object2.getPathCost(); return (cost1 > cost2) ? 1 : ((cost1 < cost2) ? -1 : 0); } }
T state = currentReverseNode.getParent().getState(); Operator<O> operation = currentReverseNode.getAppliedOp(); float cost = currentReverseNode.getPathCost() - reverseParentNode.getPathCost();
T state = currentReverseNode.getParent().getState(); Operator<O> operation = currentReverseNode.getAppliedOp(); float cost = currentReverseNode.getPathCost() - reverseParentNode.getPathCost();