3.1. Reeb Graphs
This module contains example graphs and data to use for Reeb graph computations. Pictures of these can be seen in this notebook
- cereeberus.data.ex_reebgraphs.line(a=0, b=1, seed=None)[source]
Returns the Reeb graph of a simple line as a ReebGraph class. The endpoints have function value a and b respectively.
- Parameters:
a (int) – The function values for the two vertices in increasing order.
b (int) – The function values for the two vertices in increasing order.
seed (int) – Optional. The seed to use for the random number generator, which only controls the layout function.
- Returns:
The Reeb graph of the line.
- Return type:
- cereeberus.data.ex_reebgraphs.torus(a=0, b=1, c=4, d=5, multigraph=True, seed=None)[source]
Returns the Reeb graph of a simple upright torus as a ReebGraph class.
- Parameters:
a (int) – The function values for the four vertices in increasing order.
b (int) – The function values for the four vertices in increasing order.
c (int) – The function values for the four vertices in increasing order.
d (int) – The function values for the four vertices in increasing order.
multigraph (bool) – Optional. If False, then the loop edges will be subdivided so that the resulting graph doesn’t have multiple edges between $b$ and $c$. Default is True.
seed (int) – Optional. The seed to use for the random number generator, which only controls the layout function.
- Returns:
The Reeb graph of the torus.
- Return type:
- cereeberus.data.ex_reebgraphs.dancing_man(seed=None)[source]
Returns the Reeb graph of the dancing man as a ReebGraph class.
- Parameters:
seed (int) – Optional. The seed to use for the random number generator, which only controls the layout function.
- Returns:
The Reeb graph of the dancing man.
- Return type:
- cereeberus.data.ex_reebgraphs.juggling_man(seed=None)[source]
Returns the Reeb graph of the juggling man as a ReebGraph class.
- Parameters:
seed (int) – Optional. The seed to use for the random number generator, which only controls the layout function.
- Returns:
The Reeb graph of the juggling man.
- Return type:
- cereeberus.data.ex_reebgraphs.simple_loops(seed=None)[source]
Returns the Reeb graph of the simple loops example.
- Parameters:
seed (int) – Optional. The seed to use for the random number generator, which only controls the layout function.
- Returns:
The Reeb graph of the simple loops example.
- Return type:
- cereeberus.data.ex_reebgraphs.simple_loops_unordered(seed=None)[source]
Returns the Reeb graph of the simple loops example.
- Parameters:
seed (int) – Optional. The seed to use for the random number generator, which only controls the layout function.
- Returns:
The Reeb graph of the simple loops example.
- Return type:
- cereeberus.data.ex_reebgraphs.interleave_example_A(seed=None)[source]
Returns the Reeb graph of the first example for the interleave function.
- Parameters:
seed (int) – Optional. The seed to use for the random number generator, which only controls the layout function.
- Returns:
The Reeb graph of the first example for the interleave function.
- Return type:
- cereeberus.data.ex_reebgraphs.interleave_example_B(seed=None)[source]
Returns the Reeb graph of the second example for the interleave function.
- Parameters:
seed (int) – Optional. The seed to use for the random number generator, which only controls the layout function.
- Returns:
The Reeb graph of the second example for the interleave function.
- Return type:
