Uses of Interface
bcds.phison.gm.GraphMetric

Packages that use GraphMetric

bcds.phison.gm

Classes in this package extract measurable properties of a graph, its nodes or links.

Uses of GraphMetric in bcds.phison.gm

Classes in bcds.phison.gm that implement GraphMetric

class	AlgebraicConnectivity<V,E> Computes the algebraic connectivity of a topology, that is, the second smallest eigenvalue of its Laplacian spectrum.
class	Assortativity<V,E> Computes the assortativity coefficient of a graph, based on the Pearson correlation coefficient.
class	AverageEdgeBC<V,E> Computes the average edge betweenness centrality of a directed graph.
class	AverageNeighborConnectivity<V,E> Computes the average neighbor connectivity of a topology as a GraphMetric.
class	AverageNodeBC<V,E> Computes the average node betweenness centrality of a directed graph.
class	AvgPathLength<V,E> Computes the average of the shortest path lengths in the topology, where the link weights are all 1 (hop count).
class	AvgTwoTermReliability<V,E> Computes the average two-terminal reliability coefficient of a graph.
class	BrandesBC<V,E> Computes the betweenness centrality of nodes and links in a directed graph.
class	CheegerConstantBruteForce<V,E> XXX Computes ...........
class	ClusteringCoeff<V,E> Computes the (local) clustering coefficient of each node in a graph.
class	ConnectivityMatrixSpectralRadius<V,E> Computes the largest eigenvalue of the connectivity matrix C of a topology as a GraphMetric.
class	Density<V,E> Computes the density of a topology as a GraphMetric.
class	Diameter<V,E> Computes the network diameter, identifies the path that corresponds to that diameter and computes the average of the shortest paths.
class	EdgeSetSize<V,E> Computes the number of undirected edges in a topology as a GraphMetric.
class	Heterogeneity<V,E> Computes the heterogeneity of a topology as a GraphMetric.
class	LinkConnectivity<V,E> Computes the link connectivity of a topology as a GraphMetric.
class	MaxNodeDegree<V,E> Returns the highest node degree of a topology as a GraphMetric.
class	NodeConnectivity<V,E> Computes the node connectivity of a topology as a GraphMetric.
class	OutNodeDegree<V,E> Computes the average node degree of a topology as a GraphMetric.
class	SpectralRadius<V,E> Computes the spectral radius of a topology, that is, the largest eigenvalue of its adjacency matrix.
class	Spreaders<V,E> Performs a k-shell decomposition of the nodes of a topology as a GraphMetric.
class	SymmetryRatio<V,E> Computes the symmetry ratio of a topology as a GraphMetric.
class	VertexSetSize<V,E> Computes the number of vertices in a topology as a GraphMetric.