3.1. Degree

The degree module includes functions the compute up degree, down degree and minimal reeb graphs.

cereeberus.compute.degree.up_degree(R, fx={})[source]

Compute Upper Degree of Reeb Graph degree.up_degree is deprecated. Instead use R.up_degree() to compute the up degree of a node in a Reeb graph.

Parameters:

R (reeb graph) – networkx or reeb graph to use for reeb graph computation

Returns:

dictionary of up degrees by node

Return type:

up_deg (dict)

cereeberus.compute.degree.down_degree(R, fx={})[source]

Compute Down Degree of Reeb Graph degree.down_degree is deprecated. Instead use R.down_degree() to compute the down degree of a node in a Reeb graph.

Parameters:

R (reeb graph) – networkx or reeb graph to use for reeb graph computation

Returns:

dictionary of down degrees by node

Return type:

down_deg (dict)

cereeberus.compute.degree.add_nodes(R, fx, x=0)[source]

Function to add nodes to a Reeb Graph degree.add_nodes is deprecated. You can now use R.add_node() to add nodes to a Reeb graph.

cereeberus.compute.degree.minimal_reeb(R)[source]

Function to create minimal Reeb Graph

cereeberus.compute.degree.remove_isolates(R)[source]

Function to remove isolates from Reeb Graph. Important for computation of Merge Tree

cereeberus.compute.degree.heights(graph)[source]