pm4py.algo.discovery.causal.variants.heuristic module

pm4py.algo.discovery.causal.variants.heuristic.apply(dfg: Dict[Tuple[str, str], int]) → Dict[Tuple[str, str], float]

Computes a causal graph based on a directly follows graph according to the heuristics miner

Parameters:

dfg (dict directly follows relation, should be a dict of the form (activity,activity) -> num of occ.)

Returns:

• return: dictionary containing all causal relations as keys (with value inbetween -1 and 1 indicating that

• how strong it holds)