Uses of Interface
org.processmining.models.graphbased.directed.DirectedGraph
Package
Description
-
Uses of DirectedGraph in org.processmining.models.connections
-
Uses of DirectedGraph in org.processmining.models.graphbased.directed
Modifier and TypeClassDescriptionclass
AbstractDirectedGraph<N extends DirectedGraphNode,
E extends DirectedGraphEdge<? extends N, ? extends N>> Modifier and TypeMethodDescriptionprotected abstract 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
Modifier and TypeMethodDescriptionstatic <N extends DirectedGraphNode,
E extends DirectedGraphEdge<? extends N, ? extends N>>
Collection<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>>
Collection<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, 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
Modifier and TypeMethodDescriptionstatic <N extends DirectedGraphNode,
E extends DirectedGraphEdge<? extends N, ? extends N>>
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>>
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>>
Collection<N>GraphIterator.getDirectPredecessors
(N node, DirectedGraph<N, E> graph) static <N extends DirectedGraphNode,
E extends DirectedGraphEdge<? extends N, ? extends N>>
Collection<N>GraphIterator.getDirectSuccessors
(N node, DirectedGraph<N, E> graph)