Man Linux: Main Page and Category List


       EccentricityMetric -

       EccentricyMetric.h - Compute the eccentricity of each node.


       #include <Eccentricity.h>

   Public Member Functions
       EccentricityMetric (const tlp::PropertyContext &)
       ~EccentricityMetric ()
       bool run ()

Detailed Description

       EccentricyMetric.h - Compute the eccentricity of each node.

       This plugin compute the eccentricity of each node,

       Eccentricity is the maximum distance to go from a node to all others.
       In this version the value is normalized (1 means that a node is in the
       center of the network, 0 means that a node is the more eccentric in the

       More information about the use of eccentricity metric can be found in :

       Visone: Analysis and visualization of social networks.
        ’Book. Graph Drawing Software. (Ed. Michael Junger & Petra Mutzel’,
        Authors : Ulrik Brandes and Dorothea Wagner.
        pages 321-340.


       18/06/2004 Verson 0.0.1: Initial release

           The complexity of the algorithm is O(|V| * |E|) time and O(1)

           David Auber University Bordeaux I France: Email:auber@tulip-
  Tamara Munzner, University of British Columbia Canada.


       This program is free software; you can redistribute it and/or modify it
       under the terms of the GNU General Public License as published by the
       Free Software Foundation; either version 2 of the License, or (at your
       option) any later version.

Constructor & Destructor Documentation

   EccentricityMetric::EccentricityMetric (const tlp::PropertyContext &)
   EccentricityMetric::~EccentricityMetric ()

Member Function Documentation

   bool EccentricityMetric::run ()


       Generated automatically by Doxygen for Tulip Plugins Library from the
       source code.