Uses of Interface
org.processmining.models.graphbased.directed.DirectedGraphEdge
-
Packages that use DirectedGraphEdge Package Description org.processmining.models.graphbased.directed org.processmining.models.graphbased.directed.analysis org.processmining.models.graphbased.directed.utils -
-
Uses of DirectedGraphEdge in org.processmining.models.graphbased.directed
Classes in org.processmining.models.graphbased.directed with type parameters of type DirectedGraphEdge 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>>
Classes in org.processmining.models.graphbased.directed that implement DirectedGraphEdge Modifier and Type Class Description class
AbstractDirectedGraphEdge<S extends AbstractDirectedGraphNode,T extends AbstractDirectedGraphNode>
Methods in org.processmining.models.graphbased.directed with parameters of type DirectedGraphEdge Modifier and Type Method Description abstract void
AbstractDirectedGraph. removeEdge(DirectedGraphEdge edge)
void
DirectedGraph. removeEdge(DirectedGraphEdge edge)
Removes the given edge from the graph. -
Uses of DirectedGraphEdge in org.processmining.models.graphbased.directed.analysis
Classes in org.processmining.models.graphbased.directed.analysis with type parameters of type DirectedGraphEdge 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 DirectedGraphEdge 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 DirectedGraphEdge in org.processmining.models.graphbased.directed.utils
Classes in org.processmining.models.graphbased.directed.utils with type parameters of type DirectedGraphEdge Modifier and Type Interface Description static interface
GraphIterator.EdgeAcceptor<N,E extends DirectedGraphEdge<? extends N,? extends N>>
Methods in org.processmining.models.graphbased.directed.utils with type parameters of type DirectedGraphEdge 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)
-