src/core/reinforcement/memory/SumTree.java
void update(StateTransition stateTransition) {
        Node node = stateTransitionNodeHashMap.get(stateTransition);
        if (node != null) {
            maxPriority = Math.max(maxPriority, stateTransition.priority);
            node.updatePriority(stateTransition.priority);
        }
    }
/**
     * Updates priority of state transition and entire sum tree.
     *
     * @param stateTransition state transition to be updated.
     */
Updates priority of state transition and entire sum tree.

@param stateTransition state transition to be updated.
Updates priority of state transition and entire sum tree . @param stateTransition state transition to be updated .
void update(StateTransition stateTransition) {
        Node node = stateTransitionNodeHashMap.get(stateTransition);
        if (node != null) {
            maxPriority = Math.max(maxPriority, stateTransition.priority);
            node.updatePriority(stateTransition.priority);
        }
    }
void update ( StateTransition stateTransition ) { Node node = stateTransitionNodeHashMap . get ( stateTransition ) ; if ( node != null ) { maxPriority = Math . max ( maxPriority , stateTransition . priority ) ; node . updatePriority ( stateTransition . priority ) ; } }
Updates priority of state transition and entire sum tree.
Updates priority of state transition and entire sum tree .