Package | Description |
---|---|
org.processmining.models.graphbased.directed | |
org.processmining.models.graphbased.directed.analysis | |
org.processmining.models.graphbased.directed.utils |
Modifier and Type | Class and Description |
---|---|
class |
AbstractDirectedGraph<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
interface |
DirectedGraph<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
interface |
DirectedGraphEdge<S extends DirectedGraphNode,T extends DirectedGraphNode> |
interface |
DirectedGraphEdge<S extends DirectedGraphNode,T extends DirectedGraphNode> |
static interface |
DirectedGraphEdge.MultipleSources<N extends DirectedGraphNode>
Implementations of this class should also implement DirectedGraphEdge
|
static interface |
DirectedGraphEdge.MultipleTargets<N extends DirectedGraphNode>
Implementations of this class should also implement DirectedGraphEdge,
N>
|
Modifier and Type | Interface and Description |
---|---|
interface |
BoundaryDirectedGraphNode
Interface to represent a node that can be drawn on the boundary of another
node (e.g.: an exception on a BPMN activity.) The other node will be a
ContainingDirectedGraphNode.
|
interface |
ContainingDirectedGraphNode
Interface to represent a directed graph node that contain other elements.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractDirectedGraphNode |
Modifier and Type | Method and Description |
---|---|
DirectedGraphNode |
BoundaryDirectedGraphNode.getBoundingNode() |
Modifier and Type | Method and Description |
---|---|
int |
AbstractDirectedGraphNode.compareTo(DirectedGraphNode node) |
java.util.Collection<E> |
AbstractDirectedGraph.getInEdges(DirectedGraphNode node) |
java.util.Collection<E> |
DirectedGraph.getInEdges(DirectedGraphNode node) |
java.util.Collection<E> |
AbstractDirectedGraph.getOutEdges(DirectedGraphNode node) |
java.util.Collection<E> |
DirectedGraph.getOutEdges(DirectedGraphNode node) |
void |
DirectedGraph.removeNode(DirectedGraphNode cell) |
Modifier and Type | Class and Description |
---|---|
class |
ShortestPathInfo<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
Modifier and Type | Method and Description |
---|---|
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
ComponentFactory.buggedComponentize(DirectedGraph<N,E> graph) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
ShortestPathFactory.calculateAllShortestDistanceDijkstra(DirectedGraph<N,E> graph) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
ComponentFactory.componentize(DirectedGraph<N,E> graph)
Computes strongly connected components for the given directed graph.
|
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
ComponentFactory.isTerminal(DirectedGraph<N,E> graph,
java.util.Collection<N> component)
Checks whether a component is terminal, that is, whether it has no outgoing
edges.
|
Modifier and Type | Interface and Description |
---|---|
static interface |
GraphIterator.NodeAcceptor<T extends DirectedGraphNode> |
Modifier and Type | Method and Description |
---|---|
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
GraphIterator.getDepthFirstPredecessors(N node,
DirectedGraph<N,E> graph,
GraphIterator.EdgeAcceptor<N,E> edgeAcceptor,
GraphIterator.NodeAcceptor<N> nodeAcceptor) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
GraphIterator.getDepthFirstSuccessors(N node,
DirectedGraph<N,E> graph,
GraphIterator.EdgeAcceptor<N,E> edgeAcceptor,
GraphIterator.NodeAcceptor<N> nodeAcceptor) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
GraphIterator.getDirectPredecessors(N node,
DirectedGraph<N,E> graph) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
GraphIterator.getDirectSuccessors(N node,
DirectedGraph<N,E> graph) |