NAME
DepthMetric -
DepthMetric.h - This plugins compute for each node n, the maximum path-length between n and the other node.
SYNOPSIS
#include <DepthMetric.h>
Public Member Functions
DepthMetric (const tlp::PropertyContext &)
bool run ()
bool check (std::string &)
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:[email protected]
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.
Constructor & Destructor Documentation
DepthMetric::DepthMetric (const tlp::PropertyContext &)
Member Function Documentation
bool DepthMetric::check (std::string &)
bool DepthMetric::run ()
Author
Generated automatically by Doxygen for Tulip Plugins Library from the source code.