org.javanetworkanalyzer.data
Interface VCent<V extends VCent,E>

Type Parameters:

V - Vertex

All Superinterfaces:

VPred<V,E>

All Known Implementing Classes:

VCentImpl, VUCent, VWCent

public interface VCent<V extends VCent,E>
extends VPred<V,E>

Vertex for centrality computations (used by graph analyzers).

Author:

Adam Gouge

Method Summary

void	accumulateBetweenness(double additionalBetweenness) Accumulates the betweenness value in each run by adding the new betweenness value to the old
void	accumulateDependency(double additionalDependency) Accumulates the dependency of this node
void	accumulateSPCount(long additionalSPCount) Accumulates the number of shortest paths leading to this node
double	getBetweenness() Gets the betweenness value for this node.
double	getCloseness() Returns the closeness.
double	getDependency() Gets the dependency of this node to any other vertex
int	getID() Returns the id of this node.
Set<V>	getPredecessors() Returns the predecessors.
long	getSPCount() Gets the number of shortest paths to this node
void	reset() Resets the shortest path count and dependency to zero.
void	setBetweenness(double betweenness) Sets the betweenness.
void	setCloseness(double closeness) Sets the closeness.
void	setSource() Sets the shortest path count to one and the dependency to zero.
void	setSPCount(long newSPCount) Resets the number of shortest paths leading to this node

Methods inherited from interface org.javanetworkanalyzer.data.VPred

addPredecessor, addPredecessorEdge, clear, getPredecessorEdges

Method Detail

reset

void reset()

Resets the shortest path count and dependency to zero.

setSource

void setSource()

Sets the shortest path count to one and the dependency to zero.

getID

int getID()

Returns the id of this node.

Returns:

The id of this node.

getPredecessors

Set<V> getPredecessors()

Returns the predecessors.

Specified by:

getPredecessors in interface VPred<V extends VCent,E>

Returns:

The predecessors.

getSPCount

long getSPCount()

Gets the number of shortest paths to this node

Returns:

spCount Number of shortest paths to this node

accumulateSPCount

void accumulateSPCount(long additionalSPCount)

Accumulates the number of shortest paths leading to this node

Parameters:

additionalSPCount - Number of further shortest paths leading to this node

setSPCount

void setSPCount(long newSPCount)

Resets the number of shortest paths leading to this node

Parameters:

newSPCount - New number shortest paths leading to this node

getDependency

double getDependency()

Gets the dependency of this node to any other vertex

Returns:

dependency Dependency of this node to any other vertex

accumulateDependency

void accumulateDependency(double additionalDependency)

Accumulates the dependency of this node

Parameters:

additionalDependency - New dependency to be added

getBetweenness

double getBetweenness()

Gets the betweenness value for this node.

Returns:

The betweenness value of this node.

accumulateBetweenness

void accumulateBetweenness(double additionalBetweenness)

Accumulates the betweenness value in each run by adding the new betweenness value to the old

Parameters:

additionalBetweenness - betweenness value from a run starting at certain source node

setBetweenness

void setBetweenness(double betweenness)

Sets the betweenness.

Parameters:

betweenness - The betweenness to set.

getCloseness

double getCloseness()

Returns the closeness.

Returns:

The closeness.

setCloseness

void setCloseness(double closeness)

Sets the closeness.

Parameters:

closeness - The closeness to set.