Uses of Interface
org.processmining.models.graphbased.directed.DirectedGraph
-
-
Uses of DirectedGraph in org.processmining.models.connections
Methods in org.processmining.models.connections that return DirectedGraph Modifier and Type Method Description DirectedGraph<?,?>
GraphLayoutConnection. getGraph()
Constructors in org.processmining.models.connections with parameters of type DirectedGraph Constructor Description GraphLayoutConnection(DirectedGraph<?,?> graph)
-
Uses of DirectedGraph in org.processmining.models.graphbased.directed
Classes in org.processmining.models.graphbased.directed that implement DirectedGraph Modifier and Type Class Description class
AbstractDirectedGraph<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>>
Methods in org.processmining.models.graphbased.directed that return DirectedGraph Modifier and Type Method Description DirectedGraph<?,?>
DirectedGraphElement. getGraph()
Methods in org.processmining.models.graphbased.directed with parameters of type DirectedGraph Modifier and Type Method Description protected abstract java.util.Map<? extends DirectedGraphElement,? extends DirectedGraphElement>
AbstractDirectedGraph. cloneFrom(DirectedGraph<N,E> graph)
The returned mapping satisfies: map.keySet().containsAll(graph.getNodes()) and map.keySet().containsAll(graph.getEdges())int
AbstractDirectedGraph. compareTo(DirectedGraph<N,E> o)
-
Uses of DirectedGraph in org.processmining.models.graphbased.directed.analysis
Methods in org.processmining.models.graphbased.directed.analysis with parameters of type DirectedGraph 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 DirectedGraph in org.processmining.models.graphbased.directed.utils
Methods in org.processmining.models.graphbased.directed.utils with parameters of type DirectedGraph 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)
-