Uses of Class
com.whitestein.lsps.common.graph.DirectedGraph

Packages that use DirectedGraph

Package	Description
com.whitestein.lsps.common.graph
com.whitestein.lsps.engine.profiler
com.whitestein.lsps.lang.timer

Uses of DirectedGraph in com.whitestein.lsps.common.graph

Methods in com.whitestein.lsps.common.graph that return DirectedGraph

Modifier and Type	Method and Description
static <V> DirectedGraph<V>	GraphUtils.completeGraph(Set<V> vertices) Returns complete graph over given set of vertices.
static <V> DirectedGraph<V>	GraphUtils.reverse(DirectedGraph<V> graph) Returns reverse of given graph (all edges are reversed).
static <V> DirectedGraph<V>	GraphUtils.subgraph(DirectedGraph<V> graph, Set<V> vertices) Returns new instance of DirectedGraph induced by given set of vertices on given graph.

Methods in com.whitestein.lsps.common.graph with parameters of type DirectedGraph

Modifier and Type	Method and Description
static <V> List<Edge<V>>	GraphUtils.acyclicTransitiveReduction(DirectedGraph<V> acyclicGraph) For a given acyclic graph this method returns a list of edges that can be removed to obtain a transitive reduction of the given graph.
static <V> List<List<V>>	GraphUtils.computeSCC(DirectedGraph<V> graph) Computes strongly-connected components.
static <V> List<V>	GraphUtils.getCycle(DirectedGraph<V> graph) Returns a list of vertices forming a cycle or null if the graph is acyclic.
static <V> Set<V>	GraphUtils.getVerticesInCycles(DirectedGraph<V> graph) Returns a set of all vertices that take part in a cycle.
static <V> List<V>	GraphUtils.internalTopSort(DirectedGraph<V> graph) Returns topological sort of given directed graph or null if the graph is not acyclic.
static boolean	GraphUtils.isAcyclic(DirectedGraph<?> graph) Returns true if given graph is acyclic.
static <V> DirectedGraph<V>	GraphUtils.reverse(DirectedGraph<V> graph) Returns reverse of given graph (all edges are reversed).
static <V> DirectedGraph<V>	GraphUtils.subgraph(DirectedGraph<V> graph, Set<V> vertices) Returns new instance of DirectedGraph induced by given set of vertices on given graph.
static <V> List<V>	GraphUtils.topologicalSort(DirectedGraph<V> graph) Returns topological sort of given acyclic directed graph.
static void	GraphUtils.transitiveClosure(DirectedGraph<?> graph) Adds edges to a given graph to create a transitive closure.
static <V> Set<V>	GraphUtils.transitiveClosure(DirectedGraph<V> graph, Set<? extends V> vertices) Returns transitive closure of given vertices on given graph.

Constructors in com.whitestein.lsps.common.graph with parameters of type DirectedGraph

Constructor and Description
DirectedGraph(DirectedGraph<V> graph) Creates new instance of DirectedGraph as a copy of given graph.

Uses of DirectedGraph in com.whitestein.lsps.engine.profiler

Methods in com.whitestein.lsps.engine.profiler with parameters of type DirectedGraph

Modifier and Type	Method and Description
protected void	ProfilerInterpreterStackTrace.record(ProfilerNode current, DirectedGraph<ProfilerNode> graph)

Uses of DirectedGraph in com.whitestein.lsps.lang.timer

Methods in com.whitestein.lsps.lang.timer with parameters of type DirectedGraph

Modifier and Type	Method and Description
protected abstract void	RecordingInterpreterStackTrace.record(T element, DirectedGraph<T> graph)
protected void	TimerInterpreterStackTrace.record(com.whitestein.lsps.lang.timer.TimerElement element, DirectedGraph<com.whitestein.lsps.lang.timer.TimerElement> graph)