metric(3)
NAME
- Metric
- Classes
- class ArityMetric
ArityMetric.h - Compute the degree of each node.
- class BetweennessCentrality
Betweeness centrality - An implementation of the betweeness centrality parameter.
- class BiconnectedComponnent
class ClusterMetric
class ConnectedComponentConnectedComponent.h - An implementation of the connected component algorithm. - class DagLevelMetric
DagLevelMeric.h - An implementation of DAG layer decomposition.
- class DepthMetric
DepthMetric.h - This plugins compute for each node n, the maximum path-length between n and the other node.
- class EccentricityMetric
EccentricyMetric.h - Compute the eccentricity of each node.
- class IdMetric
IdDoubleMetric.h - This plugins assigns id to nodes and edges.
- class LeafMetric
LeafMetric.h - Compute the number of leaves in the subtree induced by each node.
- class NodeMetric
NodeMetric.h - Compute the number of nodes in the subtree induced by each node.
- class RandomMetric
RandomMetric.h - This plugins assigns random values to nodes and edges.
- class StrahlerMetric
StrahlerMetric.h - An implementation of the Strahler parameter.
- class StrengthMetric
Detailed Description
Authors: David Auber, Patrick Mary, Morgan Mathiaut from the LaBRI
Visualization Team Email : auber@tulip-software.org Last modification :
13/03/2009 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.
Author
- Generated automatically by Doxygen for Tulip Plugins Library from the
source code.