code: private boolean updateInconsistent(N node, Map<Transition<A, S>, N> predecessorMap) {
          C minValue = add.getIdentityElem();
          N minParent = null;
          Transition<A, S> minTransition = null;
          for (Map.Entry<Transition<A, S>, N> current : predecessorMap
                  .entrySet()) {
              C value = add.apply(current.getValue().getV(), costFunction.evaluate(current.getKey()));
              //T value = current.getValue().v.add(this.costFunction.evaluate(current.getKey()));
              if (value.compareTo(minValue) < 0) {
                  minValue = value;
                  minParent = current.getValue();
                  minTransition = current.getKey();
              }
          }
          node.setPreviousNode(minParent);
          // node.previousNode = minParent;
          node.setG(minValue);
          node.setState(minTransition.getState());
          node.setAction(minTransition.getAction());
          // node.state = minTransition;
          node.getKey().update(node.getG(), node.getV(), heuristicFunction.estimate(minTransition.getState()), epsilon, add, scale);
          return true;
      }
docs: Updates a node in inconsistent state (V <= G), evaluating all the predecessors of the current node
  and updating the parent to the node which combination of cost and transition is minimal.
  
  @param node inconsistent {@link es.usc.citius.hipster.algorithm.ADStarForward} node to update
  @param predecessorMap map containing the the predecessor nodes and
  @return true if the node has changed its {@link es.usc.citius.hipster.model.impl.ADStarNodeImpl.Key}