Class MinimalEdgeOrdering<N>
- java.lang.Object
-
- org.processmining.extendedhybridminer.models.hybridpetrinet.candidateplaceiterator.CandidatePlaceIterator<HybridDirectedGraphNode>
-
- org.processmining.extendedhybridminer.models.hybridpetrinet.candidateplaceiterator.MinimalEdgeOrdering<N>
-
- All Implemented Interfaces:
java.util.Iterator<PartialPlaceEvaluation<HybridDirectedGraphNode>>
public class MinimalEdgeOrdering<N> extends CandidatePlaceIterator<HybridDirectedGraphNode>
-
-
Constructor Summary
Constructors 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)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description booleanhasNext()PartialPlaceEvaluation<HybridDirectedGraphNode>next()-
Methods inherited from class org.processmining.extendedhybridminer.models.hybridpetrinet.candidateplaceiterator.CandidatePlaceIterator
getCurrentLevel, getSelectionStrategy, remove
-
-
-
-
Constructor Detail
-
MinimalEdgeOrdering
public 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)
-
-
Method Detail
-
hasNext
public boolean hasNext()
-
next
public PartialPlaceEvaluation<HybridDirectedGraphNode> next()
-
-