private void visitNewNode(N predecessor, N neighbor, int distance, List<N> newList) { if (mUnvisitedNodes.contains(neighbor)) { distanceDecorator.put(neighbor, distance); newList.add(neighbor); mNodesInOrderVisited.add(neighbor); mUnvisitedNodes.remove(neighbor); } int predecessorDistance = distanceDecorator.get(predecessor).intValue(); int successorDistance = distanceDecorator.get(neighbor).intValue(); if (predecessorDistance < successorDistance) { addPredecessor(predecessor, neighbor); } }
private void visitNewVertex(V predecessor, V neighbor, int distance, List<V> newList) { if (mUnvisitedVertices.contains(neighbor)) { distanceDecorator.put(neighbor, new Integer(distance)); newList.add(neighbor); mVerticesInOrderVisited.add(neighbor); mUnvisitedVertices.remove(neighbor); } int predecessorDistance = distanceDecorator.get(predecessor).intValue(); int successorDistance = distanceDecorator.get(neighbor).intValue(); if (predecessorDistance < successorDistance) { addPredecessor(predecessor,neighbor); } }
private void visitNewVertex(V predecessor, V neighbor, int distance, List<V> newList) { if (mUnvisitedVertices.contains(neighbor)) { distanceDecorator.put(neighbor, Integer.valueOf(distance)); newList.add(neighbor); mVerticesInOrderVisited.add(neighbor); mUnvisitedVertices.remove(neighbor); } int predecessorDistance = distanceDecorator.get(predecessor).intValue(); int successorDistance = distanceDecorator.get(neighbor).intValue(); if (predecessorDistance < successorDistance) { addPredecessor(predecessor, neighbor); } }
private void visitNewVertex(V predecessor, V neighbor, int distance, List<V> newList) { if (mUnvisitedVertices.contains(neighbor)) { distanceDecorator.put(neighbor, new Integer(distance)); newList.add(neighbor); mVerticesInOrderVisited.add(neighbor); mUnvisitedVertices.remove(neighbor); } int predecessorDistance = distanceDecorator.get(predecessor).intValue(); int successorDistance = distanceDecorator.get(neighbor).intValue(); if (predecessorDistance < successorDistance) { addPredecessor(predecessor,neighbor); } }