NewClusteringNodes: Function to return details of each node in a tabular format....

In thecomeonman/CURD: Implementation of the CURD algorithm for clustering

Description

Function to return details of each node in a tabular format. TreeStretchedToBottom is a wrapper to this function

Usage

NewClusteringNodes(lTree, iParentNodeIndex = 0, iLayerNbr = 0)

Arguments

lTree	is an output of RecursivePartitioningTreeClustering
iParentNodeIndex	= 0 is used to trace the recursive calls. When user is calling the function, he/she needn't declare a value for this.
iLayerNbr	= 0 is used to trace the recursive calls. When user is calling the function, he/she needn't declare a value for this.
value	(The members column is wrong in this example. It will actually be members in that node.) ParentNodeIndex NodeLabel NodeColumnName NodeColumnValue LeafNode Members LayerNbr 1: 0 Root>1 elsalvadoraid n FALSE 232 1 2: Root>1 Root>1>1 handicappedinfants n FALSE 232 2 3: Root>1>1 Root>1>1>1 aidtonicaraguancontras n TRUE 232 3 4: Root>1>1 Root>1>1>2 aidtonicaraguancontras y FALSE 232 3 5: Root>1>1>2 Root>1>1>2>1 mxmissile n TRUE 232 4 6: Root>1>1>2 Root>1>1>2>2 mxmissile y FALSE 232 4

thecomeonman/CURD documentation built on May 20, 2019, 7:37 a.m.