Package bcds.phison.gm

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

See:
Description

Interface Summary

GraphMetric<V,E>

A graph metric is a measure of some property of the graph, its nodes or edges.

Class Summary

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

Enum Summary

BetweennessCentrality.Flags
MetricTarget	Defines the domain of a metric, that is, if it is applicable to the whole graph, nodes or links.

Package bcds.phison.gm Description

Classes in this package extract measurable properties of a graph, its nodes or links. Examples of such measurable properties, called metrics, are average nodal degree, betweenness centrality and spectral radius, among others. Thus, a class in this package computes one metric. By implementing the GraphMetric, the class offers the possibility that client code can interact with it in a uniform way, without needding to know too much about its peculiarities.

The class GraphMetricBase is a default implementation of the GraphMetric interface which can be used as base class for implementing metrics.

When developing a class in this package or that implements its main interface, bear in mind that the user should be able to load it dynamically.

The tool Metrics can instantiate dynamically GraphMetric classes and make them work on one or more topologies.