Package edu.uci.ics.jung.algorithms.metrics


package edu.uci.ics.jung.algorithms.metrics
Specialized measures for graph properties. These currently include:
  • StructuralHoles: calculates some of Burt's 'structural holes' measures (e.g. efficiency, hierarchy, constraint).
  • TriadicCensus: returns counts for each triad type found in a graph.
  • Classes
    Class
    Description
    A class consisting of static methods for calculating graph metrics.
    Calculates some of the measures from Burt's text "Structural Holes: The Social Structure of Competition".
    TriadicCensus is a standard social network tool that counts, for each of the different possible configurations of three vertices, the number of times that that configuration occurs in the given graph.