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>> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractDirectedGraphEdge<S extends AbstractDirectedGraphNode,T extends AbstractDirectedGraphNode> |
Modifier and Type | Method and Description |
---|---|
abstract void |
AbstractDirectedGraph.removeEdge(DirectedGraphEdge edge) |
void |
DirectedGraph.removeEdge(DirectedGraphEdge edge)
Removes the given edge from the graph.
|
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.EdgeAcceptor<N,E extends DirectedGraphEdge<? extends N,? extends N>> |
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) |