# Component tree¶

 higra.component_tree_min_tree(graph, …) Min Tree hierarchy from the input vertex weighted graph. higra.component_tree_max_tree(graph, …) Max Tree hierarchy from the input vertex weighted graph.
component_tree_min_tree(graph, vertex_weights)[source]

Min Tree hierarchy from the input vertex weighted graph.

The Min/Max Tree structure were proposed in [1], [2]. The algorithm used in this implementation was first described in [3].

Parameters:
• graph – input graph

• vertex_weights – vertex weights of the input graph

Returns:

a tree (Concept CptHierarchy) and its node altitudes

component_tree_max_tree(graph, vertex_weights)[source]

Max Tree hierarchy from the input vertex weighted graph.

The Min/Max Tree structure were proposed in [1], [2]. The algorithm used in this implementation was first described in [3].

Parameters:
• graph – input graph

• vertex_weights – vertex weights of the input graph

Returns:

a tree (Concept CptHierarchy) and its node altitudes