treestat

Introduction

Feature statistics algorithm for tree, including height and width features：

• The height is defined as the maximum path length from the root node to the leaf node
• Width is defined as the number of nodes contained in the layer with the most nodes

Parameters

use --help param to view detailed help information.

Input Format

Input files should be formatted as follows:

<src><sep><dst>

where <src> and <dst> are integers of type uint32_t, representing the end nodes of an edge. <sep>is the separator, which could only be comma. Note that Plato treats every input graph as undirected by default. For a directed graph, please ensure both <A, B> and <B, A> appear in the input file if they exist. Edges that appear more than once will only take the latest one.

Input example (Following numbers are synthetic and are for demonstration purpose only.)：

4564,823192
...
1996,973033

Output Format

if stat equals 'width,depth', Output files will be formatted as follows: <width>,<depth>, <width> is tree's width <depth> is tree's depth

Output example (Following numbers are synthetic and are for demonstration purpose only.)：

154,12

Code

https://github.com/Tencent/plato/blob/master/example/tree_stat_simple.cc