pm4py.objects.process_tree.utils.bottomup module#
- pm4py.objects.process_tree.utils.bottomup.get_max_trace_length(tree, parameters=None)[source]#
Get the maximum length of a trace allowed by the process tree (can be infty)
- Parameters:
tree – Process tree
parameters – Possible parameters of the algorithm
- Returns:
The maximum length of a trace
- Return type:
max_trace_length
- pm4py.objects.process_tree.utils.bottomup.get_min_trace_length(tree, parameters=None)[source]#
Get the minimum length of a trace allowed by the process tree
- Parameters:
tree – Process tree
parameters – Possible parameters of the algorithm
- Returns:
The minimum length of a trace
- Return type:
min_trace_length
- pm4py.objects.process_tree.utils.bottomup.get_max_rem_dict(tree, parameters=None)[source]#
Gets for each node of the tree the maximum number of activities that are inserted to ‘complete’ a trace of the overall tree
- Parameters:
tree – Process tree
parameters – Parameters of the algorithm
- Returns:
Dictionary described in the docstring
- Return type:
max_rem_dict
- pm4py.objects.process_tree.utils.bottomup.get_min_rem_dict(tree, parameters=None)[source]#
Gets for each node of the tree the minimum number of activities that are inserted to ‘complete’ a trace of the overall tree
- Parameters:
tree – Process tree
parameters – Parameters of the algorithm
- Returns:
Dictionary described in the docstring
- Return type:
min_rem_dict
- pm4py.objects.process_tree.utils.bottomup.get_max_length_dict(node, max_length_dict, num_nodes)[source]#
Populates, given the nodes of a tree in a bottom-up order, the maximum length dictionary (every trace generated from that point of the tree has at most length N)
- Parameters:
node – Node
max_length_dict – Dictionary that is populated in-place
num_nodes – Number of nodes in the process tree
- pm4py.objects.process_tree.utils.bottomup.get_min_length_dict(node, min_length_dict)[source]#
Populates, given the nodes of a tree in a bottom-up order, the minimum length dictionary (every trace generated from that point of the tree has at least length N)
- Parameters:
node – Node
min_length_dict – Dictionary that is populated in-place
- pm4py.objects.process_tree.utils.bottomup.get_bottomup_nodes(tree, parameters=None)[source]#
Gets the nodes of a tree in a bottomup order (leafs come first, the master node comes after)
- Parameters:
tree – Process tree
parameters – Parameters of the algorithm
- Returns:
Nodes of the tree in a bottomup order
- Return type:
bottomup_nodes