DepthMetric Class Reference
[Metric]
#include <DepthMetric.h>
List of all members.
Detailed Description
DepthMetric.h - This plugins compute for each node n, the maximum path-length between n and the other node.
This plugins compute for each node n, the maximum path-length between n and the other node. The graph must be acyclic.
HISTORY
- 26/02/2001 Verson 0.0.1: First implementation.
- Note:
- This algorithm works on general graphs.
- Author:
- David Auber University Bordeaux I France: Email:auber@tulip-software.org
LICENCE
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.
|
Public Member Functions |
| DepthMetric (const tlp::PropertyContext &) |
bool | run () |
bool | check (std::string &) |
Constructor & Destructor Documentation
DepthMetric::DepthMetric |
( |
const tlp::PropertyContext & |
|
) |
|
|
Member Function Documentation
bool DepthMetric::check |
( |
std::string & |
|
) |
|
|
bool DepthMetric::run |
( |
|
) |
|
|
Generated on Fri Jan 5 14:21:37 2007 for Tulip Plugins by
1.4.6