|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object nz.ac.waikato.mcennis.rat.graph.model.ModelShell nz.ac.waikato.mcennis.rat.graph.algorithm.prestige.AddCombinedCloseness
public class AddCombinedCloseness
Optimized version of Closeness as defined by Freeman79. This version integrates
path calculations into the loop. While still O(n2) in time, it is now O(n) in space.
Freeman, L. "Centrality in social networks: I. Conceptual clarification."
Social Networks. 1:215--239.
Field Summary | |
---|---|
static long |
serialVersionUID
|
Fields inherited from class nz.ac.waikato.mcennis.rat.graph.model.ModelShell |
---|
listener |
Constructor Summary | |
---|---|
AddCombinedCloseness()
Creates a new instance of AddGeodesicPaths |
Method Summary | |
---|---|
void |
calculateGraphCentrality(Graph g)
Calculate the mean value for actor centrality. |
void |
calculateGraphCentralitySD(Graph g)
Calculate Standard Deviation for actor centrality. |
void |
calculateGraphPrestige(Graph g)
Calculate the mean value for actor prestige. |
void |
calculateGraphPrestigeSD(Graph g)
Calculate Standard Deviation for actor prestige. |
void |
execute(Graph g)
Uses Djikstra's algorithm for spanning trees. |
InputDescriptor[] |
getInputType()
The input type describes all the different kinds of graph objects that are utilized (and hence required) by this object. |
OutputDescriptor[] |
getOutputType()
The output type describes all the different kinds of graph objects that are created during the execution of this algorithm. |
Parameter[] |
getParameter()
List of all parameters this component accepts. |
Parameter |
getParameter(java.lang.String param)
Returns the specific parameter identified by its key-name. |
SettableParameter[] |
getSettableParameter()
Returns settable (i.e. |
SettableParameter |
getSettableParameter(java.lang.String param)
Return the settable parameter namede by this key-name. |
void |
init(java.util.Properties map)
Parameters for initialization 'name' - name of this isntance. |
protected void |
nextStepNodes(Graph g)
Place node expansion into node expansion map. |
protected void |
processVectors(Graph g,
int userNumber)
for each vector in the list process end node for each geodesic |
Methods inherited from class nz.ac.waikato.mcennis.rat.graph.model.ModelShell |
---|
addListener, fireChange |
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.model.Model |
---|
addListener |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public AddCombinedCloseness()
Method Detail |
---|
public void execute(Graph g)
execute
in interface Algorithm
g
- graph to be modifiedprotected void nextStepNodes(Graph g)
g
- graph containing the nodes to be parsed.protected void processVectors(Graph g, int userNumber)
g
- graph for betweeness calculationsuserNumber
- which user is being calculated.public InputDescriptor[] getInputType()
Component
getInputType
in interface Component
InputDescriptor
public OutputDescriptor[] getOutputType()
Component
getOutputType
in interface Component
OutputDescriptor
public Parameter[] getParameter()
Component
getParameter
in interface Component
public Parameter getParameter(java.lang.String param)
Component
getParameter
in interface Component
param
- key-name of the parameter
public SettableParameter[] getSettableParameter()
Component
getSettableParameter
in interface Component
public SettableParameter getSettableParameter(java.lang.String param)
Component
getSettableParameter
in interface Component
param
- key-name of the parameter
public void init(java.util.Properties map)
init
in interface Component
map
- map of the given properties naming parameters and their values in a stringpublic void calculateGraphCentrality(Graph g)
g
- graph to be modifiedpublic void calculateGraphPrestige(Graph g)
g
- graph to be modifiedpublic void calculateGraphCentralitySD(Graph g)
g
- graph to be modifiedpublic void calculateGraphPrestigeSD(Graph g)
g
- graph to be modified
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |