org.gephi.statistics.plugin

Class ClusteringCoefficient

java.lang.Object

org.gephi.statistics.plugin.ClusteringCoefficient

All Implemented Interfaces:

Statistics, LongTask

public class ClusteringCoefficient
extends Object
implements Statistics, LongTask

Author:

Patrick J. McSweeney

Field Summary

Fields

Modifier and Type	Field and Description
private double	avgClusteringCoeff The avergage Clustering Coefficient.
static String	CLUSTERING_COEFF
private boolean	isCanceled Indicates statistics should stop processing/
private boolean	isDirected Indicates should treat graph as undirected.
private int	K
private int	N
private ArrayWrapper[]	network
private double[]	nodeClustering
private ProgressTicket	progress Keeps track of Progress made.
private int	totalTriangles
private int[]	triangles

Constructor Summary

Constructors

Constructor and Description
ClusteringCoefficient()

Method Summary

Modifier and Type	Method and Description
private double	bruteForce(org.gephi.graph.api.Graph hgraph)
boolean	cancel() Cancel the task.
private int	closest_in_array(ArrayWrapper[] currentNetwork, int v)
HashMap<String,Double>	computeClusteringCoefficient(org.gephi.graph.api.Graph hgraph, ArrayWrapper[] currentNetwork, int[] currentTriangles, double[] currentNodeClustering, boolean directed)
private float	computeNodeClusteringCoefficient(org.gephi.graph.api.Graph hgraph, org.gephi.graph.api.Node node, boolean directed)
private int	computeRemainingTrianles(org.gephi.graph.api.Graph hgraph, ArrayWrapper[] currentNetwork, int[] currentTriangles, int currentProgress)
private HashMap<String,Double>	computeResultValues(org.gephi.graph.api.Graph hgraph, ArrayWrapper[] currentNetwork, int[] currentTriangles, double[] currentNodeClusterig, boolean directed, int currentProgress)
private HashMap<String,Double>	computeTriangles(org.gephi.graph.api.Graph hgraph, ArrayWrapper[] currentNetwork, int[] currentTriangles, double[] nodeClustering, boolean directed)
int	createIndiciesMapAndInitNetwork(org.gephi.graph.api.Graph hgraph, HashMap<org.gephi.graph.api.Node,Integer> indicies, ArrayWrapper[] networks, int currentProgress)
private HashMap<org.gephi.graph.api.Node,EdgeWrapper>	createNeighbourTable(org.gephi.graph.api.Graph hgraph, org.gephi.graph.api.Node node, HashMap<org.gephi.graph.api.Node,Integer> indicies, ArrayWrapper[] networks, boolean directed)
void	execute(org.gephi.graph.api.Graph hgraph)
void	execute(org.gephi.graph.api.GraphModel graphModel) Executes the statistics algorithm.
double	getAverageClusteringCoefficient()
double[]	getCoefficientReuslts()
private EdgeWrapper[]	getEdges(HashMap<org.gephi.graph.api.Node,EdgeWrapper> neighborTable)
String	getReport() Returns an HTML string that displays the statistics result.
double[]	getTriangesReuslts()
private float	increaseCCifNesessary(org.gephi.graph.api.Graph hgraph, org.gephi.graph.api.Node neighbor1, org.gephi.graph.api.Node neighbor2, boolean directed, float nodeCC)
private org.gephi.graph.api.Column	initializeAttributeColunms(org.gephi.graph.api.GraphModel graphModel)
void	initStartValues(org.gephi.graph.api.Graph hgraph)
boolean	isDirected()
private void	newVertex(ArrayWrapper[] currentNetwork, int[] currentTrianlgles, int v, int n)
private int	processNetwork(ArrayWrapper[] currentNetwork, int currentProgress)
private void	saveCalculatedValue(org.gephi.graph.api.Node node, org.gephi.graph.api.Column clusteringColumn, double nodeClusteringCoefficient)
void	setDirected(boolean isDirected)
void	setProgressTicket(ProgressTicket ProgressTicket) Set the progress ticket for the long task.
private void	tr_link_nohigh(ArrayWrapper[] currentNetwork, int[] currentTriangles, int u, int v, int count, int k)
void	triangles(org.gephi.graph.api.Graph hgraph)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

CLUSTERING_COEFF

public static final String CLUSTERING_COEFF

See Also:

Constant Field Values

avgClusteringCoeff

private double avgClusteringCoeff

The avergage Clustering Coefficient.

isDirected

private boolean isDirected

Indicates should treat graph as undirected.

isCanceled

private boolean isCanceled

Indicates statistics should stop processing/

progress

private ProgressTicket progress

Keeps track of Progress made.

triangles

private int[] triangles

network

private ArrayWrapper[] network

K

private int K

N

private int N

nodeClustering

private double[] nodeClustering

totalTriangles

private int totalTriangles

Constructor Detail

ClusteringCoefficient

public ClusteringCoefficient()

Method Detail

getAverageClusteringCoefficient

public double getAverageClusteringCoefficient()

execute

public void execute(org.gephi.graph.api.GraphModel graphModel)

Description copied from interface: Statistics

Executes the statistics algorithm.

It is preferable to work on visible graphs, to be synchronized with the visualization.

Specified by:

execute in interface Statistics

Parameters:

graphModel - The graph model

execute

public void execute(org.gephi.graph.api.Graph hgraph)

triangles

public void triangles(org.gephi.graph.api.Graph hgraph)

computeClusteringCoefficient

public HashMap<String,Double> computeClusteringCoefficient(org.gephi.graph.api.Graph hgraph,
                                                           ArrayWrapper[] currentNetwork,
                                                           int[] currentTriangles,
                                                           double[] currentNodeClustering,
                                                           boolean directed)

initStartValues

public void initStartValues(org.gephi.graph.api.Graph hgraph)

createIndiciesMapAndInitNetwork

public int createIndiciesMapAndInitNetwork(org.gephi.graph.api.Graph hgraph,
                                           HashMap<org.gephi.graph.api.Node,Integer> indicies,
                                           ArrayWrapper[] networks,
                                           int currentProgress)

closest_in_array

private int closest_in_array(ArrayWrapper[] currentNetwork,
                             int v)

newVertex

private void newVertex(ArrayWrapper[] currentNetwork,
                       int[] currentTrianlgles,
                       int v,
                       int n)

Parameters:

v - - The specific node to count the triangles on.

tr_link_nohigh

private void tr_link_nohigh(ArrayWrapper[] currentNetwork,
                            int[] currentTriangles,
                            int u,
                            int v,
                            int count,
                            int k)

createNeighbourTable

private HashMap<org.gephi.graph.api.Node,EdgeWrapper> createNeighbourTable(org.gephi.graph.api.Graph hgraph,
                                                                           org.gephi.graph.api.Node node,
                                                                           HashMap<org.gephi.graph.api.Node,Integer> indicies,
                                                                           ArrayWrapper[] networks,
                                                                           boolean directed)

getEdges

private EdgeWrapper[] getEdges(HashMap<org.gephi.graph.api.Node,EdgeWrapper> neighborTable)

processNetwork

private int processNetwork(ArrayWrapper[] currentNetwork,
                           int currentProgress)

computeRemainingTrianles

private int computeRemainingTrianles(org.gephi.graph.api.Graph hgraph,
                                     ArrayWrapper[] currentNetwork,
                                     int[] currentTriangles,
                                     int currentProgress)

computeResultValues

private HashMap<String,Double> computeResultValues(org.gephi.graph.api.Graph hgraph,
                                                   ArrayWrapper[] currentNetwork,
                                                   int[] currentTriangles,
                                                   double[] currentNodeClusterig,
                                                   boolean directed,
                                                   int currentProgress)

computeTriangles

private HashMap<String,Double> computeTriangles(org.gephi.graph.api.Graph hgraph,
                                                ArrayWrapper[] currentNetwork,
                                                int[] currentTriangles,
                                                double[] nodeClustering,
                                                boolean directed)

bruteForce

private double bruteForce(org.gephi.graph.api.Graph hgraph)

increaseCCifNesessary

private float increaseCCifNesessary(org.gephi.graph.api.Graph hgraph,
                                    org.gephi.graph.api.Node neighbor1,
                                    org.gephi.graph.api.Node neighbor2,
                                    boolean directed,
                                    float nodeCC)

computeNodeClusteringCoefficient

private float computeNodeClusteringCoefficient(org.gephi.graph.api.Graph hgraph,
                                               org.gephi.graph.api.Node node,
                                               boolean directed)

initializeAttributeColunms

private org.gephi.graph.api.Column initializeAttributeColunms(org.gephi.graph.api.GraphModel graphModel)

saveCalculatedValue

private void saveCalculatedValue(org.gephi.graph.api.Node node,
                                 org.gephi.graph.api.Column clusteringColumn,
                                 double nodeClusteringCoefficient)

getReport

public String getReport()

Description copied from interface: Statistics

Returns an HTML string that displays the statistics result. Can contains complex HTML snippets and images.

Specified by:

getReport in interface Statistics

Returns:

An HTML string that displays the results for this Statistics

setDirected

public void setDirected(boolean isDirected)

isDirected

public boolean isDirected()

cancel

public boolean cancel()

Description copied from interface: LongTask

Cancel the task. Returns true if the task has been sucessfully cancelled, false otherwise.

Specified by:

cancel in interface LongTask

Returns:

true if the task has been sucessfully cancelled, false otherwise

setProgressTicket

public void setProgressTicket(ProgressTicket ProgressTicket)

Description copied from interface: LongTask

Set the progress ticket for the long task. Can't be null.

Specified by:

setProgressTicket in interface LongTask

Parameters:

ProgressTicket - the progress ticket for this task

getCoefficientReuslts

public double[] getCoefficientReuslts()

getTriangesReuslts

public double[] getTriangesReuslts()