/** * Clears the predecessor list, resets the distance to the default value and * resets the shortest path count and dependency to zero. */ @Override public void reset() { // Clear the predecessor list and reset the distance to the default // distance. super.reset(); // Reset the shortest path count and dependency to zero. vCent.reset(); }
/** * Clears the predecessor list, sets the distance and dependency to zero and * the shortest path count to one. */ @Override public void setSource() { // Clear the predecessor list and set the distance to zero. super.setSource(); // Set the shortest path count to one and the dependency to zero. vCent.setSource(); }
/** * Clears the predecessor list, sets the distance and dependency to zero and * the shortest path count to one. */ @Override public void setSource() { // Clear the predecessor list and set the distance to zero. super.setSource(); // Set the shortest path count to one and the dependency to zero. vCent.setSource(); }
/** * Clears the predecessor list, resets the distance to the default value and * resets the shortest path count and dependency to zero. */ @Override public void reset() { // Clear the predecessor list and reset the distance to the default // distance. super.reset(); // Reset the shortest path count and dependency to zero. vCent.reset(); }
@Override protected void firstTimeFoundStep( final VUCent current, final VUCent neighbor) { // Add this to the path length data. (For closeness) pathsFromStartNode.addSPLength(neighbor.getDistance()); }
/** * Clears the predecessor list and resets the distance to the default * distance. */ @Override public void reset() { // Clear the predecessor list. super.clear(); // Reset the distance to the default distance. distance = DEFAULT_DISTANCE; }
/** * Constructor: sets the id and initializes a local {@link VCentImpl}. * * @param id Id */ public VWCent(Integer id) { super(id); vCent = new VCentImpl(id); }
@Override public void clear() { super.clear(); totalLength = 0; maxLength = 0; }
@Override public void setCloseness(double closeness) { vCent.setCloseness(closeness); } }
@Override public void accumulateSPCount(long additionalSPCount) { vCent.accumulateSPCount(additionalSPCount); }
@Override public void setSPCount(long newSPCount) { vCent.setSPCount(newSPCount); }
@Override public void setBetweenness(double betweenness) { vCent.setBetweenness(betweenness); }
@Override public double getCloseness() { return vCent.getCloseness(); }
/** * Constructs a new {@link DijkstraForCentrality} object. * * @param graph The graph. * @param stack The stack which will return nodes ordered by non-increasing * distance from startNode. */ public DijkstraForCentrality( Graph<VWCent, E> graph, Stack<VWCent> stack) { super(graph); this.stack = stack; this.pathsFromStartNode = new WeightedPathLengthData(); }
/** * Clears the predecessor list and resets the distance to the default * distance. */ @Override public void reset() { // Clear the predecessor list. super.clear(); // Reset the distance to the default distance. distance = DEFAULT_DISTANCE; }
/** * Constructor: sets the id and initializes a local {@link VCentImpl}. * * @param id Id */ public VUCent(Integer id) { super(id); vCent = new VCentImpl(id); }
@Override public void clear() { super.clear(); totalLength = 0.0; maxLength = 0.0; }
@Override public void setCloseness(double closeness) { vCent.setCloseness(closeness); } }
/** * Clears the predecessor list and sets the distance to zero. */ @Override public void setSource() { // Clear the predecessor list. super.clear(); // Set the distance to zero. distance = 0.0; } }
/** * Clears the predecessor list and sets the distance to zero. */ @Override public void setSource() { // Clear the predecessor list. super.clear(); // Set the distance to zero. distance = 0; } }