nz.ac.waikato.mcennis.rat.graph.algorithm.prestige
Class Betweeness
java.lang.Object
nz.ac.waikato.mcennis.rat.graph.model.ModelShell
nz.ac.waikato.mcennis.rat.graph.algorithm.OptimizedPathBase
nz.ac.waikato.mcennis.rat.graph.algorithm.prestige.Betweeness
- All Implemented Interfaces:
- java.io.Serializable, Component, Algorithm, Model
public class Betweeness
- extends OptimizedPathBase
- implements Algorithm
Class built upon OptimizedPathBase that claculates Betweeness. OptimizedPathBase
only records one geodesic path for each actor pair, otherwise same as the
betweeness metric deefined in Freeman79.
Freeman, L. "Centrality in social networks: I. Conceptual clarification."
Social Networks. 1:215--239.
- See Also:
- Serialized Form
Constructor Summary |
Betweeness()
Creates a new instance of OptimizedBetweeness |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface nz.ac.waikato.mcennis.rat.graph.algorithm.Algorithm |
execute |
Methods inherited from interface nz.ac.waikato.mcennis.rat.graph.model.Model |
addListener |
Betweeness
public Betweeness()
- Creates a new instance of OptimizedBetweeness
doCleanup
protected void doCleanup(PathNode[] path,
Graph g)
- Description copied from class:
OptimizedPathBase
- Any additional calculations to be performed before control returns to the
scheduler
- Specified by:
doCleanup
in class OptimizedPathBase
doAnalysis
protected void doAnalysis(PathNode[] path,
PathNode source)
- Specified by:
doAnalysis
in class OptimizedPathBase
setSize
protected void setSize(int size)
- Specified by:
setSize
in class OptimizedPathBase
calculateGraphBetweeness
protected void calculateGraphBetweeness(Graph g)
calculateBetweenessSD
protected void calculateBetweenessSD(Graph g)
init
public void init(Properties map)
- Description copied from class:
OptimizedPathBase
- Parameters to be initialized. Subclasses should override if they provide
any additional parameters or require additional inputs.
- 'name' - Name of this instance of the algorithm. Default is ''.
- 'relation' - type (relation) of link to calculate over. Default 'Knows'.
- 'actorType' - type (mode) of actor to calculate over. Deafult 'User'.
- 'normalize' - boolean for whether or not to normalize prestige vectors.
Default 'false'.
Input 0 - Link
NOTE - subclasses define the ouput - see subclasses for output information
- Specified by:
init
in interface Component
- Specified by:
init
in class OptimizedPathBase
- Parameters:
map
- map of the given properties naming parameters and their values in a string
prototype
public Betweeness prototype()
- Description copied from interface:
Component
- All Components implement the prototype pattern. The new parameter has no common resources
to the original that are not static resources o the class.
- Specified by:
prototype
in interface Component
- Specified by:
prototype
in interface Algorithm
- Specified by:
prototype
in class OptimizedPathBase
- Returns:
- default-parameter version of the same class as the original.