|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectsim.field.network.stats.NetworkStatistics
| Constructor Summary | |
NetworkStatistics()
|
|
| Method Summary | |
static long[][] |
floydWarshallNumberShortestPathsMatrix(Network network,
EdgeMetric computer,
double precision)
Get the numer of shortest paths (from any node to any other node) using the Floyd-Warshall algorithm. |
static long[][][] |
floydWarshallNumberShortestPathsWithIntermediatesMatrix(Network network,
EdgeMetric computer,
double precision)
Get the numer of shortest paths (from any node through a second node to a third node) using the Floyd-Warshall algorithm. |
static double[][] |
floydWarshallShortestPathsMatrix(Network network,
EdgeMetric computer)
Get the shortest paths matrix (from any node to any other node) using the Floyd-Warshall algorithm. |
static double |
getClusteringCoefficient(Network network)
Computes the clustering coefficient, i.e. |
static double |
getDensity(Network network)
Returns the density of a matrix (the ratio of number of actual edges in the network to the maximum number of edges that can exist in the network). |
static double |
getDiameter(Network network,
EdgeMetric computer)
Computes the diameter of a network (the maximum node eccentricity). |
static boolean |
getHasSelfLoops(Network network)
Checks whether the network has self loops or not (a self-loop is a link from a node to itself). |
static double |
getInclusiveness(Network network)
Returns the inclusiveness of the network (the ratio of non-isolated nodes to total number of nodes in the network). |
static Bag |
getIsolatedNodes(Network network)
Returns a list containing the isolated nodes in the network (nodes with zero in-degree and zero out-degree). |
static double |
getMeanShortestPath(Network network,
EdgeMetric computer)
Returns the average length of the shortest path between nodes in the network. |
static double |
getNodeEccentricity(Network network,
java.lang.Object node,
EdgeMetric computer)
Returns the eccentricity of a node. |
static int |
getNumberActualEdges(Network network)
Returns the number of edges in the network. |
static int |
getNumberNodes(Network network)
Returns the number of nodes in the network. |
static int |
getNumberPotentialEdges(Network network)
Returns the maximum number of edges in the network. |
static long[][] |
getNumberShortestPathsMatrix(Network network,
EdgeMetric computer,
double precision)
Get the matrix with number of shortest paths (from any node to any other node) |
static long[][][] |
getNumberShortestPathsWithIntermediatesMatrix(Network network,
EdgeMetric computer,
double precision)
Get the numer of shortest paths (from any node through a second node to a third node). |
static double |
getRadius(Network network,
EdgeMetric computer)
Compute the radius of a network (the minimum node eccentricity). |
static double |
getShortestPath(Network network,
java.lang.Object startNode,
java.lang.Object endNode,
EdgeMetric computer)
Returns the shortest path (number of edges) between two nodes indicated by their indexes in the allNodes Bag. |
static double[] |
getShortestPaths(Network network,
java.lang.Object startNode,
EdgeMetric computer)
Returns a vector with distances to the nodes in the graph. |
static double[][] |
getShortestPathsMatrix(Network network,
EdgeMetric computer)
Get the shortest paths matrix (from any node to any other node) |
static double |
getSymmetryCoefficient(Network network)
Computes the amount of symmetry in the network, ie the ratio of edges i->j and j->i over all edges. |
static boolean |
isMultigraphNetwork(Network network)
Checks whether the network is a multigraph or not (a multigraph may contain several edges from a node i to a node j). |
static long[][] |
johnsonNumberShortestPathsMatrix(Network network,
EdgeMetric computer,
double precision)
Get the shortest paths matrix (from any node to any other node) using the Johnson algorithm for sparse graphs. |
static double[][] |
johnsonShortestPathsMatrix(Network network,
EdgeMetric computer)
Get the shortest paths matrix (from any node to any other node) using the Johnson algorithm for sparse graphs. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public NetworkStatistics()
| Method Detail |
public static int getNumberNodes(Network network)
public static int getNumberPotentialEdges(Network network)
public static int getNumberActualEdges(Network network)
public static double getDensity(Network network)
public static Bag getIsolatedNodes(Network network)
public static double getInclusiveness(Network network)
public static double[] getShortestPaths(Network network,
java.lang.Object startNode,
EdgeMetric computer)
public static double getShortestPath(Network network,
java.lang.Object startNode,
java.lang.Object endNode,
EdgeMetric computer)
public static double getClusteringCoefficient(Network network)
public static boolean isMultigraphNetwork(Network network)
public static boolean getHasSelfLoops(Network network)
public static double getSymmetryCoefficient(Network network)
public static double[][] getShortestPathsMatrix(Network network,
EdgeMetric computer)
public static double[][] floydWarshallShortestPathsMatrix(Network network,
EdgeMetric computer)
public static double[][] johnsonShortestPathsMatrix(Network network,
EdgeMetric computer)
public static double getMeanShortestPath(Network network,
EdgeMetric computer)
public static double getNodeEccentricity(Network network,
java.lang.Object node,
EdgeMetric computer)
public static double getRadius(Network network,
EdgeMetric computer)
public static double getDiameter(Network network,
EdgeMetric computer)
public static long[][] johnsonNumberShortestPathsMatrix(Network network,
EdgeMetric computer,
double precision)
public static long[][] floydWarshallNumberShortestPathsMatrix(Network network,
EdgeMetric computer,
double precision)
public static long[][][] floydWarshallNumberShortestPathsWithIntermediatesMatrix(Network network,
EdgeMetric computer,
double precision)
public static long[][] getNumberShortestPathsMatrix(Network network,
EdgeMetric computer,
double precision)
public static long[][][] getNumberShortestPathsWithIntermediatesMatrix(Network network,
EdgeMetric computer,
double precision)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||