public class GraphTheoryMetrics
extends Object
Auxiliary static methods with metrics related to graph theory.
Constructor and Description |
---|
GraphTheoryMetrics() |
Modifier and Type | Method and Description |
---|---|
static double[] |
convertPathList2PathCost(List<int[]> pathList,
double[] costVector) |
static double[] |
getAdjacencyMatrixEigenvalues(int[][] linkTable,
int N) |
static double |
getAlgebraicConnectivity(int[][] linkTable,
int N) |
static List<int[]> |
getAllPairsShortestPaths(int[][] linkTable,
int N,
double[] costVector) |
static double |
getAssortativity(int[][] linkTable,
int N) |
static double |
getAverageNeighborConnectivity(int[][] linkTable,
int N) |
static double |
getAverageShortestPathDistance(int[][] linkTable,
int N,
double[] costVector) |
static double |
getAverageTwoTermReliability(int[][] linkTable,
int N) |
static double[][] |
getBetweenessCentrality(int[][] linkTable,
int N,
double[] costVector) |
static double |
getClusteringCoefficient(int[][] linkTable,
int N) |
static double |
getDensity(int[][] linkTable,
int N) |
static double |
getDiameter(int[][] linkTable,
int N,
double[] costVector) |
static double[] |
getLaplacianMatrixEigenvalues(int[][] linkTable,
int N) |
static int |
getLinkConnectivity(int[][] linkTable,
int N) |
static int[] |
getNeighbors(int[][] linkTable,
int nodeId) |
static cern.colt.matrix.tdouble.DoubleMatrix2D |
getNodeAdjacencyMatrix(int[][] linkTable,
int N) |
static int |
getNodeConnectivity(int[][] linkTable,
int N) |
static cern.colt.matrix.tdouble.DoubleMatrix2D |
getNodeLinkIncidenceMatrix(int[][] linkTable,
int N) |
static int[] |
getOutNodeDegree(int[][] linkTable,
int N) |
static double |
getSpectralRadius(int[][] linkTable,
int N) |
static double |
getSymmetryRatio(int[][] linkTable,
int N) |
public static double getDensity(int[][] linkTable, int N)
public static double[] convertPathList2PathCost(List<int[]> pathList, double[] costVector)
public static double getDiameter(int[][] linkTable, int N, double[] costVector)
public static List<int[]> getAllPairsShortestPaths(int[][] linkTable, int N, double[] costVector)
public static double[] getAdjacencyMatrixEigenvalues(int[][] linkTable, int N)
public static double[] getLaplacianMatrixEigenvalues(int[][] linkTable, int N)
public static double getSpectralRadius(int[][] linkTable, int N)
public static double getAssortativity(int[][] linkTable, int N)
public static int[] getNeighbors(int[][] linkTable, int nodeId)
public static double getClusteringCoefficient(int[][] linkTable, int N)
public static int getNodeConnectivity(int[][] linkTable, int N)
public static int getLinkConnectivity(int[][] linkTable, int N)
public static double getAverageTwoTermReliability(int[][] linkTable, int N)
public static double getAverageNeighborConnectivity(int[][] linkTable, int N)
public static double[][] getBetweenessCentrality(int[][] linkTable, int N, double[] costVector)
public static double getSymmetryRatio(int[][] linkTable, int N)
public static double getAverageShortestPathDistance(int[][] linkTable, int N, double[] costVector)
public static double getAlgebraicConnectivity(int[][] linkTable, int N)
public static int[] getOutNodeDegree(int[][] linkTable, int N)
public static cern.colt.matrix.tdouble.DoubleMatrix2D getNodeAdjacencyMatrix(int[][] linkTable, int N)
public static cern.colt.matrix.tdouble.DoubleMatrix2D getNodeLinkIncidenceMatrix(int[][] linkTable, int N)