public class GraphStatistics
extends java.lang.Object
Constructor and Description |
---|
GraphStatistics() |
GraphStatistics(BidirectionalGraph g) |
Modifier and Type | Method and Description |
---|---|
double |
averageDegree()
Computes the average degree
|
double |
averagePathLength()
Computes the average path length
|
java.util.Vector<java.util.TreeSet<java.lang.Integer>> |
calculateCliques()
This method calculates cliques in a graph.
|
DegreeDistribution |
calculateDegreeDistribution()
Computes the degree distribution
|
double |
clusteringCoefficient()
Computes the clustering coefficient of the whole graph
|
double |
clusteringCoefficient(java.lang.Integer vertice)
Computes the clustering coefficient of a vertice
|
double |
getAverageDegree() |
double |
getAverageDegreeQuadrat() |
double |
getAveragePathLength()
Returns the average path length
|
int |
getCliqueCount() |
CliqueDistribution |
getCliqueDistribution()
Walkes the complete graph and computes cliques
|
double |
getClusteringCoefficient()
Returns the clustering coefficient.
|
int |
getDiameter()
Returns the diameter of a graph.
|
java.lang.Integer |
getEdgesCount()
Gets the Edges Count
|
BidirectionalGraph |
getGraph()
Returns this graph
|
java.util.Vector<BidirectionalGraph> |
getIndependentSets() |
java.math.BigDecimal |
getLinkDensity()
Returns the link density
|
int |
getNodesCount()
Returns the Vertice count.
|
java.lang.String |
getStatisticsSummaryAsStringRepresentation() |
java.util.HashMap<java.lang.Integer,java.util.TreeSet<java.lang.Integer>> |
getVisitedHashMap() |
void |
printStatisticsSummary() |
void |
setAverageDegree(double averageDegree) |
void |
setAverageDegreeQuadrat(double averageDegreeQuadrat) |
void |
setAveragePathLength(double averagePathLength)
Sets the average Path length
|
void |
setCliqueCount(int cliqueCount) |
void |
setClusteringCoefficient(double clusteringCoefficient)
sets the clustering coefficient
|
void |
setGraph(BidirectionalGraph graph)
sets a graph to be this graph
|
public GraphStatistics()
public GraphStatistics(BidirectionalGraph g)
public CliqueDistribution getCliqueDistribution()
public java.util.Vector<java.util.TreeSet<java.lang.Integer>> calculateCliques()
public DegreeDistribution calculateDegreeDistribution()
public double clusteringCoefficient()
public double clusteringCoefficient(java.lang.Integer vertice)
public double averagePathLength()
public double averageDegree()
public BidirectionalGraph getGraph()
public void setGraph(BidirectionalGraph graph)
graph
- public double getClusteringCoefficient()
public java.math.BigDecimal getLinkDensity()
public java.lang.Integer getEdgesCount()
public void setClusteringCoefficient(double clusteringCoefficient)
clusteringCoefficient
- public double getAveragePathLength()
public void setAveragePathLength(double averagePathLength)
averagePathLength
- public int getDiameter()
public int getNodesCount()
public void printStatisticsSummary()
public java.lang.String getStatisticsSummaryAsStringRepresentation()
public int getCliqueCount()
public void setCliqueCount(int cliqueCount)
public double getAverageDegree()
public void setAverageDegree(double averageDegree)
public double getAverageDegreeQuadrat()
public void setAverageDegreeQuadrat(double averageDegreeQuadrat)
public java.util.Vector<BidirectionalGraph> getIndependentSets()
public java.util.HashMap<java.lang.Integer,java.util.TreeSet<java.lang.Integer>> getVisitedHashMap()