/** * reset local state */ private void reset() { paths.clear(); stack.clear(); queue.clear(); Arrays.fill(sigma, 0); Arrays.fill(delta, 0); Arrays.fill(distance, -1); } }
/** * reset local state */ private void reset() { paths.clear(); stack.clear(); queue.clear(); Arrays.fill(sigma, 0); Arrays.fill(delta, 0); Arrays.fill(distance, -1); } }
private void reset() { visited.clear(); queue.clear(); costs.clear(); path.clear(); finalPath.clear(); totalCost = NO_PATH_FOUND; }
private void reset() { visited.clear(); queue.clear(); costs.clear(); path.clear(); finalPath.clear(); totalCost = NO_PATH_FOUND; }
private void reset() { closedNodes.clear(); openNodes.clear(); gCosts.clear(); fCosts.clear(); path.clear(); shortestPath.clear(); totalCost = NO_PATH_FOUND; }
private void reset() { closedNodes.clear(); openNodes.clear(); gCosts.clear(); fCosts.clear(); path.clear(); shortestPath.clear(); totalCost = NO_PATH_FOUND; }
private boolean compute(int startNode) { clearPaths(); stack.clear(); queue.clear(); Arrays.fill(sigma, 0); Arrays.fill(delta, 0);
private boolean compute(int startNode) { clearPaths(); stack.clear(); queue.clear(); Arrays.fill(sigma, 0); Arrays.fill(delta, 0);
nodeQueue.clear(); nodeQueue.addLast(i); nodesChecked[i] = true;