Package org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy

Class MinimalPlaces<N>

java.lang.Object

org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy.DefaultConflictStrategy<HybridDirectedGraphNode>

org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy.MinimalPlaces<N>

All Implemented Interfaces:

ConflictStrategy<HybridDirectedGraphNode>

public class MinimalPlaces<N>
extends DefaultConflictStrategy<HybridDirectedGraphNode>

Field Summary

Fields

Modifier and Type	Field	Description
protected ExtendedCausalGraph	cg
protected java.util.Set<HybridDirectedGraphEdge>	currentEdges
protected java.util.Set<HybridDirectedGraphNode>	currentSources
protected java.util.Set<HybridDirectedGraphNode>	currentTargets
protected java.util.LinkedHashSet<HybridDirectedGraphEdge>	edges
protected java.util.Map<java.lang.Integer,HybridDirectedGraphEdge>	edgesHashMap
protected boolean	longDep
protected java.util.Map<HybridDirectedGraphNode,java.lang.Integer>	mapActivityToIndex
protected java.util.Map<HybridDirectedGraphNode,java.util.Set<HybridDirectedGraphEdge>>	mapSourceToEdges
protected java.util.Map<HybridDirectedGraphNode,java.util.Set<HybridDirectedGraphEdge>>	mapTargetToEdges
protected java.util.LinkedHashSet<PlaceEvaluation<HybridDirectedGraphNode>>	places
protected java.util.LinkedHashSet<java.lang.Integer>	removedEdges
protected java.util.Map<HybridDirectedGraphNode,java.lang.Double>	reversedInputDirectSuccessionMetric
protected java.util.Map<HybridDirectedGraphNode,java.lang.Double>	reversedOutputDirectSuccessionMetric
protected java.util.Set<HybridDirectedGraphNode>	sourcesWithRODSBelowThreshold
protected java.util.Set<HybridDirectedGraphNode>	targetsWithRIDSBelowThreshold
protected java.util.Map<java.lang.Integer,HybridDirectedGraphEdge>	transitiveEdgesHashMap

Constructor Summary

Constructors

Constructor	Description
MinimalPlaces(java.util.LinkedHashSet<HybridDirectedGraphEdge> edges2, java.util.LinkedHashSet<HybridDirectedGraphEdge> removedEdges, java.util.LinkedHashSet<HybridDirectedGraphNode> outputNodes, java.util.LinkedHashSet<HybridDirectedGraphNode> inputNodes, ExtendedCausalGraph cg, boolean longDep)

Method Summary

Modifier and Type	Method	Description
void	addPlace(PlaceEvaluation<HybridDirectedGraphNode> p)
HybridDirectedGraphEdge	addTransitiveEdge(HybridDirectedGraphNode source, HybridDirectedGraphNode target)
protected void	calculateInitialMetrics()
boolean	checkConflict(PartialPlaceEvaluation<HybridDirectedGraphNode> ppe)
HybridDirectedGraphEdge	getEdge(HybridDirectedGraphNode source, HybridDirectedGraphNode target)
java.util.LinkedHashSet<HybridDirectedGraphEdge>	getEdges()
java.util.Set<PlaceEvaluation<HybridDirectedGraphNode>>	getPlacesToBeAdded()

Methods inherited from class org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy.DefaultConflictStrategy

conflicting

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

edges

protected java.util.LinkedHashSet<HybridDirectedGraphEdge> edges

edgesHashMap

protected java.util.Map<java.lang.Integer,HybridDirectedGraphEdge> edgesHashMap

removedEdges

protected java.util.LinkedHashSet<java.lang.Integer> removedEdges

transitiveEdgesHashMap

protected java.util.Map<java.lang.Integer,HybridDirectedGraphEdge> transitiveEdgesHashMap

places

protected java.util.LinkedHashSet<PlaceEvaluation<HybridDirectedGraphNode>> places

currentEdges

protected java.util.Set<HybridDirectedGraphEdge> currentEdges

currentSources

protected java.util.Set<HybridDirectedGraphNode> currentSources

currentTargets

protected java.util.Set<HybridDirectedGraphNode> currentTargets

sourcesWithRODSBelowThreshold

protected java.util.Set<HybridDirectedGraphNode> sourcesWithRODSBelowThreshold

targetsWithRIDSBelowThreshold

protected java.util.Set<HybridDirectedGraphNode> targetsWithRIDSBelowThreshold

mapSourceToEdges

protected java.util.Map<HybridDirectedGraphNode,java.util.Set<HybridDirectedGraphEdge>> mapSourceToEdges

mapTargetToEdges

protected java.util.Map<HybridDirectedGraphNode,java.util.Set<HybridDirectedGraphEdge>> mapTargetToEdges

reversedOutputDirectSuccessionMetric

protected java.util.Map<HybridDirectedGraphNode,java.lang.Double> reversedOutputDirectSuccessionMetric

reversedInputDirectSuccessionMetric

protected java.util.Map<HybridDirectedGraphNode,java.lang.Double> reversedInputDirectSuccessionMetric

cg

protected ExtendedCausalGraph cg

mapActivityToIndex

protected java.util.Map<HybridDirectedGraphNode,java.lang.Integer> mapActivityToIndex

longDep

protected boolean longDep

Constructor Detail

MinimalPlaces

public MinimalPlaces(java.util.LinkedHashSet<HybridDirectedGraphEdge> edges2,
                     java.util.LinkedHashSet<HybridDirectedGraphEdge> removedEdges,
                     java.util.LinkedHashSet<HybridDirectedGraphNode> outputNodes,
                     java.util.LinkedHashSet<HybridDirectedGraphNode> inputNodes,
                     ExtendedCausalGraph cg,
                     boolean longDep)

Method Detail

calculateInitialMetrics

protected void calculateInitialMetrics()

getEdges

public java.util.LinkedHashSet<HybridDirectedGraphEdge> getEdges()

checkConflict

public boolean checkConflict(PartialPlaceEvaluation<HybridDirectedGraphNode> ppe)

addPlace

public void addPlace(PlaceEvaluation<HybridDirectedGraphNode> p)

getPlacesToBeAdded

public java.util.Set<PlaceEvaluation<HybridDirectedGraphNode>> getPlacesToBeAdded()

getEdge

public HybridDirectedGraphEdge getEdge(HybridDirectedGraphNode source,
                                       HybridDirectedGraphNode target)

addTransitiveEdge

public HybridDirectedGraphEdge addTransitiveEdge(HybridDirectedGraphNode source,
                                                 HybridDirectedGraphNode target)