Uses of Interface
org.processmining.models.graphbased.directed.DirectedGraphNode
-
Packages that use DirectedGraphNode Package Description org.processmining.models.graphbased.directed org.processmining.models.graphbased.directed.analysis org.processmining.models.graphbased.directed.utils -
-
Uses of DirectedGraphNode in org.processmining.models.graphbased.directed
Classes in org.processmining.models.graphbased.directed with type parameters of type DirectedGraphNode Modifier and Type Class 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 DirectedGraphEdgestatic interface
DirectedGraphEdge.MultipleTargets<N extends DirectedGraphNode>
Implementations of this class should also implement DirectedGraphEdge, N>Subinterfaces of DirectedGraphNode in org.processmining.models.graphbased.directed Modifier and Type Interface 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.Classes in org.processmining.models.graphbased.directed that implement DirectedGraphNode Modifier and Type Class Description class
AbstractDirectedGraphNode
Methods in org.processmining.models.graphbased.directed that return DirectedGraphNode Modifier and Type Method Description DirectedGraphNode
BoundaryDirectedGraphNode. getBoundingNode()
Methods in org.processmining.models.graphbased.directed with parameters of type DirectedGraphNode Modifier and Type Method 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)
-
Uses of DirectedGraphNode in org.processmining.models.graphbased.directed.analysis
Classes in org.processmining.models.graphbased.directed.analysis with type parameters of type DirectedGraphNode Modifier and Type Class Description class
ShortestPathInfo<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>>
Methods in org.processmining.models.graphbased.directed.analysis with type parameters of type DirectedGraphNode Modifier and Type Method Description static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>>
java.util.Collection<java.util.Collection<N>>ComponentFactory. buggedComponentize(DirectedGraph<N,E> graph)
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>>
ShortestPathInfo<N,E>ShortestPathFactory. calculateAllShortestDistanceDijkstra(DirectedGraph<N,E> graph)
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>>
java.util.Collection<java.util.Collection<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>>
booleanComponentFactory. isTerminal(DirectedGraph<N,E> graph, java.util.Collection<N> component)
Checks whether a component is terminal, that is, whether it has no outgoing edges. -
Uses of DirectedGraphNode in org.processmining.models.graphbased.directed.utils
Classes in org.processmining.models.graphbased.directed.utils with type parameters of type DirectedGraphNode Modifier and Type Interface Description static interface
GraphIterator.NodeAcceptor<T extends DirectedGraphNode>
Methods in org.processmining.models.graphbased.directed.utils with type parameters of type DirectedGraphNode Modifier and Type Method Description static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>>
java.util.Collection<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>>
java.util.Collection<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>>
java.util.Collection<N>GraphIterator. getDirectPredecessors(N node, DirectedGraph<N,E> graph)
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>>
java.util.Collection<N>GraphIterator. getDirectSuccessors(N node, DirectedGraph<N,E> graph)
-