/** Performs one step of this algorithm; updates the state (value) for each node. */ public void step() { swapOutputForCurrent(); max_delta = 0; for (N v : graph.nodes()) { double diff = update(v); updateMaxDelta(v, diff); } total_iterations++; afterStep(); }
/** * Performs one step of this algorithm; updates the state (value) for each vertex. */ public void step() { swapOutputForCurrent(); for (V v : graph.getVertices()) { double diff = update(v); updateMaxDelta(v, diff); } total_iterations++; afterStep(); }
/** * Performs one step of this algorithm; updates the state (value) for each * vertex. */ @Override public void step() { swapOutputForCurrent(); for (V v : graph.getVertices()) { double diff = update(v); updateMaxDelta(v, diff); } total_iterations++; afterStep(); }
/** * Performs one step of this algorithm; updates the state (value) for each vertex. */ public void step() { swapOutputForCurrent(); for (V v : graph.getVertices()) { double diff = update(v); updateMaxDelta(v, diff); } total_iterations++; afterStep(); }