#include <cmath>
#include <stdio.h>
#include "StrahlerMetric.h"
#include <tulip/StringProperty.h>
Include dependency graph for StrahlerMetric.cpp:
Namespaces | |
namespace | std |
Classes | |
struct | std::couple |
struct | std::equal_to< couple > |
struct | std::less< couple > |
struct | StackEval |
struct | GreaterStackEval |
Defines | |
#define | COMPUTATION_TYPE "Type" |
#define | COMPUTATION_TYPES "all;registers;stacks;" |
#define | ALL 0 |
#define | REGISTERS 1 |
#define | STACKS 2 |
Functions | |
DOUBLEPLUGINOFGROUP (StrahlerMetric,"Strahler","David Auber","06/04/2000","Alpha","0","1","Graph") | |
int | max (int i1, int i2) |
int | min (int i1, int i2) |
Variables | |
const char * | paramHelp [] |
|
|
|
|
|
|
|
|
|
|
|
Author: David Auber Email : auber@labri.fr Last modification : 20/08/2001 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. |
|
|
|
|
|
Initial value: { HTML_HELP_OPEN() HTML_HELP_DEF( "type", "bool" ) HTML_HELP_DEF( "values", "true, false" ) HTML_HELP_DEF( "default", "false" ) HTML_HELP_BODY() "If true the strahler number will be computed for each node, it means that a spanning tree will be recomputed for each nodes complexity o(n^2)." HTML_HELP_CLOSE(), HTML_HELP_OPEN() HTML_HELP_DEF( "type", "String Collection" ) HTML_HELP_DEF("Values", "all <BR> registers<BR> stacks") HTML_HELP_DEF( "default", "all" ) HTML_HELP_BODY() "This parameter enables to choose the type of computation" } |