Modifier and Type | Method and Description |
---|---|
static <V> Graph<V> |
TransitiveClosure.transitiveClosure(java.lang.Class<V> clazz,
Graph<V> graph) |
Modifier and Type | Method and Description |
---|---|
static <V> gnu.trove.map.TIntLongMap |
IntegerMultiSet.create(MultiSet<V> multiSet,
Graph<V> graph) |
static <V> Graph<V> |
TransitiveClosure.transitiveClosure(java.lang.Class<V> clazz,
Graph<V> graph) |
Modifier and Type | Method and Description |
---|---|
Graph<org.deckfour.xes.classification.XEventClass> |
Dfg.getConcurrencyGraph()
Deprecated.
|
Graph<org.deckfour.xes.classification.XEventClass> |
DfgImpl.getConcurrencyGraph() |
Graph<org.deckfour.xes.classification.XEventClass> |
Dfg.getDirectlyFollowsGraph()
Deprecated.
|
Graph<org.deckfour.xes.classification.XEventClass> |
DfgImpl.getDirectlyFollowsGraph() |
Modifier and Type | Class and Description |
---|---|
class |
GraphImplLinearEdge<V> |
class |
GraphImplLinearEdgeImportOptimised<V> |
class |
GraphImplQuadratic<V> |
Modifier and Type | Method and Description |
---|---|
Graph<V> |
Graph.clone() |
Graph<V> |
GraphImplLinearEdge.clone() |
Graph<V> |
GraphImplLinearEdgeImportOptimised.clone() |
Graph<V> |
GraphImplQuadratic.clone() |
static <V> Graph<V> |
GraphFactory.create(java.lang.Class<?> clazz,
int initialSize) |
static <V> Graph<V> |
GraphFactory.createRandomEdgeAdding(java.lang.Class<?> clazz,
int initialSize) |
static <V> Graph<V> |
GraphFactory.createTimeOptimised(java.lang.Class<?> clazz,
int initialSize) |
Modifier and Type | Method and Description |
---|---|
static <Y> java.util.Set<java.util.Set<Y>> |
ConnectedComponents.compute(Graph<Y> G)
Returns the connected components of G.
|
static <Y> java.util.List<java.util.Set<Y>> |
ConnectedComponents2.compute(Graph<Y> graph)
Returns the connected components of G.
|
static <Y> java.util.Set<java.util.Set<Y>> |
StronglyConnectedComponents.compute(Graph<Y> G)
Get the strongly connected components within G.
|
Modifier and Type | Method and Description |
---|---|
static Cut |
CutFinderIMExclusiveChoice.findCut(Graph<org.deckfour.xes.classification.XEventClass> graph) |
Constructor and Description |
---|
CutFinderIMSequenceReachability(Graph<?> graph) |
Modifier and Type | Method and Description |
---|---|
Graph<org.deckfour.xes.classification.XEventClass> |
CutFinderIMinInfo.getGraph() |
Graph<org.deckfour.xes.classification.XEventClass> |
CutFinderIMinInfo.getTransitiveGraph() |
Constructor and Description |
---|
CutFinderIMinInfo(Dfg dfg,
Graph<org.deckfour.xes.classification.XEventClass> graph2,
Graph<org.deckfour.xes.classification.XEventClass> transitiveGraph2,
java.util.Map<org.deckfour.xes.classification.XEventClass,MultiSet<org.deckfour.xes.classification.XEventClass>> minimumSelfDistancesBetween,
Probabilities probabilities,
JobList jobList,
boolean debug)
A CutFinderIMinInfo keeps track of a single call to the IMin cut finder.
|
CutFinderIMinInfo(Dfg dfg,
Graph<org.deckfour.xes.classification.XEventClass> graph2,
Graph<org.deckfour.xes.classification.XEventClass> transitiveGraph2,
java.util.Map<org.deckfour.xes.classification.XEventClass,MultiSet<org.deckfour.xes.classification.XEventClass>> minimumSelfDistancesBetween,
Probabilities probabilities,
JobList jobList,
boolean debug)
A CutFinderIMinInfo keeps track of a single call to the IMin cut finder.
|
Modifier and Type | Method and Description |
---|---|
static Cut |
CutFinderIMlcConcurrent.findCut(Dfg dfg,
Graph<org.deckfour.xes.classification.XEventClass> concurrencyGraph) |
static Cut |
CutFinderIMlcInterleaved.findCutBasic(Dfg dfg,
Graph<org.deckfour.xes.classification.XEventClass> directGraph,
Graph<org.deckfour.xes.classification.XEventClass> concurrencyGraph) |
static Cut |
CutFinderIMlcInterleaved.findCutBasic(Dfg dfg,
Graph<org.deckfour.xes.classification.XEventClass> directGraph,
Graph<org.deckfour.xes.classification.XEventClass> concurrencyGraph) |
static Cut |
CutFinderIMlcInterleaved.findSpecialCase(Dfg dfg,
java.util.Collection<java.util.Set<org.deckfour.xes.classification.XEventClass>> partition,
Graph<org.deckfour.xes.classification.XEventClass> directlyFollowsGraph)
Finds the special case int(A, B) where A is not interleaved itself (B
might be).
|
Modifier and Type | Method and Description |
---|---|
void |
FootPrint.DfgUnfoldedNode.absorb(Graph<java.lang.String> otherDfg,
Graph<java.lang.String> otherConcurrency) |
void |
FootPrint.DfgUnfoldedNode.absorb(Graph<java.lang.String> otherDfg,
Graph<java.lang.String> otherConcurrency) |