void |
EntryDG.addL2Ldependencies(java.util.AbstractMap<java.lang.String,java.lang.Float> dependencyValues,
double l2lThreshold,
java.util.AbstractMap<java.lang.String,EntryDG> relations) |
void |
EntryDG.checkUnconnectedTasks(java.util.AbstractMap<java.lang.String,EntryDG> relations) |
void |
EntryDG.computeDependencies(java.util.AbstractMap<java.lang.String,EntryDG> relations,
double dependencyThreshold,
double relativeToBestThreshold) |
protected static java.util.HashMap<java.lang.String,EntryDG> |
HeuristicsMiner.computeLongDistanceDependencies(java.util.HashMap<java.lang.String,EntryDG> dg,
java.util.HashMap<java.lang.String,EntrySJ<Counter>> sj,
LatticeValues values,
FlexibleHeuristicsMinerSettings settings) |
protected static java.util.HashMap<java.lang.String,EntrySJ<java.lang.Integer[]>> |
HeuristicsMiner.computeSplitsJoins(java.util.HashMap<java.lang.String,EntryDG> dependencyGraph,
LatticeValues values) |
protected static java.util.HashMap<java.lang.String,EntrySJ<Counter>> |
HeuristicsMiner.computeSplitsJoinsFrequencies(java.util.HashMap<java.lang.String,EntryDG> dg,
java.util.HashMap<java.lang.String,EntrySJ<java.lang.Integer[]>> sj) |
void |
EntryDG.computeStrongestDependencies(java.util.AbstractMap<java.lang.String,EntryDG> relations) |
void |
EntryDG.removeWeakDependencies(java.util.AbstractMap<java.lang.String,EntryDG> relations,
double l2lThreshold,
double dependencyThreshold,
double relativeToBestThreshold) |