Uses of Class
org.processmining.extendedhybridminer.models.causalgraph.HybridDirectedGraphNode

Packages that use HybridDirectedGraphNode

Package	Description
org.processmining.extendedhybridminer.models.causalgraph
org.processmining.extendedhybridminer.models.hybridpetrinet.candidateplaceiterator
org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy

Uses of HybridDirectedGraphNode in org.processmining.extendedhybridminer.models.causalgraph

Methods in org.processmining.extendedhybridminer.models.causalgraph that return HybridDirectedGraphNode

Modifier and Type	Method	Description
HybridDirectedGraphNode	ExtendedCausalGraph.addNode(java.lang.String nodeLabel)	We build fuzzyCausalGraph with a strong limitation: we do not ever have two nodes with the same label.
HybridDirectedGraphNode	ExtendedCausalGraph.getNode(java.lang.String label)

Methods in org.processmining.extendedhybridminer.models.causalgraph that return types with arguments of type HybridDirectedGraphNode

Modifier and Type	Method	Description
java.util.Map<HybridDirectedGraphNode,java.lang.Integer>	ExtendedCausalGraph.getNodesMapping()

Methods in org.processmining.extendedhybridminer.models.causalgraph with parameters of type HybridDirectedGraphNode

Modifier and Type	Method	Description
HybridDirectedLongDepGraphEdge	ExtendedCausalGraph.addLongDepEdge(HybridDirectedGraphNode sourceNode, HybridDirectedGraphNode targetNode)
HybridDirectedSureGraphEdge	ExtendedCausalGraph.addSureEdge(HybridDirectedGraphNode sourceNode, HybridDirectedGraphNode targetNode)
HybridDirectedUncertainGraphEdge	ExtendedCausalGraph.addUncertainEdge(HybridDirectedGraphNode sourceNode, HybridDirectedGraphNode targetNode)

Constructors in org.processmining.extendedhybridminer.models.causalgraph with parameters of type HybridDirectedGraphNode

Constructor	Description
HybridDirectedGraphEdge(HybridDirectedGraphNode source, HybridDirectedGraphNode target)
HybridDirectedLongDepGraphEdge(HybridDirectedGraphNode source, HybridDirectedGraphNode target)
HybridDirectedSureGraphEdge(HybridDirectedGraphNode source, HybridDirectedGraphNode target)
HybridDirectedUncertainGraphEdge(HybridDirectedGraphNode source, HybridDirectedGraphNode target)

Uses of HybridDirectedGraphNode in org.processmining.extendedhybridminer.models.hybridpetrinet.candidateplaceiterator

Methods in org.processmining.extendedhybridminer.models.hybridpetrinet.candidateplaceiterator that return types with arguments of type HybridDirectedGraphNode

Modifier and Type	Method	Description
java.util.Iterator<PartialPlaceEvaluation<HybridDirectedGraphNode>>	EdgePWSetMatrixMinimalOLD.addLevel(int level)
java.util.Iterator<PartialPlaceEvaluation<HybridDirectedGraphNode>>	MinimalPlaceIteratorMatrix.addLevel(int level)
java.util.LinkedHashSet<PartialPlaceEvaluation<HybridDirectedGraphNode>>	EdgePWSetMatrixMinimalOLD.getElement(int i)
java.util.Iterator<PartialPlaceEvaluation<HybridDirectedGraphNode>>	EdgePWSetMatrixMinimalOLD.getLevel(int level)
PartialPlaceEvaluation<HybridDirectedGraphNode>	MinimalEdgeOrdering.next()

Method parameters in org.processmining.extendedhybridminer.models.hybridpetrinet.candidateplaceiterator with type arguments of type HybridDirectedGraphNode

Modifier and Type	Method	Description
boolean	MinimalPlaceIteratorMatrix.mapPlaceToEdges(PartialPlaceEvaluation<HybridDirectedGraphNode> ppe)

Constructor parameters in org.processmining.extendedhybridminer.models.hybridpetrinet.candidateplaceiterator with type arguments of type HybridDirectedGraphNode

Constructor

Description

MinimalEdgeOrdering(EdgesOrderingCompatibleSelStrategy<HybridDirectedGraphNode> selectionStrategy, MinimalPlaces conflictStrategy, java.util.LinkedHashSet<HybridDirectedGraphEdge> edges, java.util.LinkedHashSet<HybridDirectedGraphEdge> removedEdges, java.util.LinkedHashSet<HybridDirectedGraphNode> outputNodes, java.util.LinkedHashSet<HybridDirectedGraphNode> inputNodes, MinimalPlaces conflcitStrategy, int thresholdStopIt)

Uses of HybridDirectedGraphNode in org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy

Fields in org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy with type parameters of type HybridDirectedGraphNode

Modifier and Type	Field	Description
protected java.util.Set<HybridDirectedGraphNode>	MinimalPlaces.currentSources
protected java.util.Set<HybridDirectedGraphNode>	MinimalPlaces.currentTargets
protected java.util.Map<HybridDirectedGraphNode,java.lang.Integer>	MinimalPlaces.mapActivityToIndex
protected java.util.Map<HybridDirectedGraphNode,java.util.Set<HybridDirectedGraphEdge>>	MinimalPlaces.mapSourceToEdges
protected java.util.Map<HybridDirectedGraphNode,java.util.Set<HybridDirectedGraphEdge>>	MinimalPlaces.mapTargetToEdges
protected java.util.LinkedHashSet<PlaceEvaluation<HybridDirectedGraphNode>>	MinimalPlaces.places
protected java.util.Map<HybridDirectedGraphNode,java.lang.Double>	MinimalPlaces.reversedInputDirectSuccessionMetric
protected java.util.Map<HybridDirectedGraphNode,java.lang.Double>	MinimalPlaces.reversedOutputDirectSuccessionMetric
protected java.util.Set<HybridDirectedGraphNode>	MinimalPlaces.sourcesWithRODSBelowThreshold
protected java.util.Set<HybridDirectedGraphNode>	MinimalPlaces.targetsWithRIDSBelowThreshold

Methods in org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy that return types with arguments of type HybridDirectedGraphNode

Modifier and Type	Method	Description
java.util.Set<PlaceEvaluation<HybridDirectedGraphNode>>	MinimalPlaces.getPlacesToBeAdded()

Methods in org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy with parameters of type HybridDirectedGraphNode

Modifier and Type	Method	Description
HybridDirectedGraphEdge	MinimalPlaces.addTransitiveEdge(HybridDirectedGraphNode source, HybridDirectedGraphNode target)
HybridDirectedGraphEdge	MinimalPlaces.getEdge(HybridDirectedGraphNode source, HybridDirectedGraphNode target)

Method parameters in org.processmining.extendedhybridminer.models.hybridpetrinet.conflictstrategy with type arguments of type HybridDirectedGraphNode

Modifier and Type	Method	Description
void	MinimalPlaces.addPlace(PlaceEvaluation<HybridDirectedGraphNode> p)
boolean	MinimalPlaces.checkConflict(PartialPlaceEvaluation<HybridDirectedGraphNode> ppe)