Package | Description |
---|---|
org.processmining.plugins.InductiveMiner.graphs | |
org.processmining.plugins.inductiveminer2.helperclasses.normalised |
Modifier and Type | Interface and Description |
---|---|
interface |
Graph<V> |
Modifier and Type | Class and Description |
---|---|
class |
GraphImplLinearEdge<V> |
class |
GraphImplLinearEdgeImportOptimised<V> |
class |
GraphImplQuadratic<V> |
Modifier and Type | Class and Description |
---|---|
class |
NormalisedIntGraphImplQuadratic |
Modifier and Type | Method and Description |
---|---|
NormalisedIntGraph |
NormalisedIntGraph.clone() |
NormalisedIntGraph |
NormalisedIntDfg.getConcurrencyGraph() |
NormalisedIntGraph |
NormalisedIntDfgImpl.getConcurrencyGraph() |
NormalisedIntGraph |
NormalisedIntDfg.getDirectlyFollowsGraph() |
NormalisedIntGraph |
NormalisedIntDfgImpl.getDirectlyFollowsGraph() |
Modifier and Type | Method and Description |
---|---|
static java.util.List<gnu.trove.set.TIntSet> |
NormalisedIntConnectedComponents.compute(NormalisedIntGraph graph,
int numberOfNodes)
Returns the connected components of G.
|
static java.util.Set<gnu.trove.set.TIntSet> |
NormalisedIntStronglyConnectedComponents.compute(NormalisedIntGraph G,
int numberOfVertices)
Get the strongly connected components within G.
|