Uses of Interface
org.jhotdraw8.graph.DirectedGraph
Packages that use DirectedGraph
Package
Description
References:
Wikipedia.
-
Uses of DirectedGraph in org.jhotdraw8.graph
Subinterfaces of DirectedGraph in org.jhotdraw8.graphModifier and TypeInterfaceDescriptioninterfaceBidiGraph<V,A> Adds convenience methods to the interface defined inBareBidiGraph.interfaceMutableBidiGraph<V,A> Interface for a mutable directed graph that allows to follow arrows in backward direction.interfaceMutableDirectedGraph<V,A> Interface for a mutable directed graph.Classes in org.jhotdraw8.graph that implement DirectedGraphModifier and TypeClassDescriptionclassImmutableDirectedGraph.classImmutableDirectedGraph.classImmutableDirectedGraph.classProvides aBidiGraphfacade for anIndexedBidiGraph.classProvides aDirectedGraphfacade for anIndexedDirectedGraph.classA mutable bidi graph with balanced performance for all operations.classSimpleMutableDirectedGraph.Methods in org.jhotdraw8.graph with parameters of type DirectedGraphModifier and TypeMethodDescription<V,A> void DirectedGraphBuilder.addAll(@NonNull DirectedGraph<V, A> source, @NonNull MutableDirectedGraph<V, A> target) Adds the source graph to the target graph.<V,A, VV, AA>
voidDirectedGraphBuilder.addAll(@NonNull DirectedGraph<VV, AA> source, @NonNull MutableDirectedGraph<V, A> target, @NonNull Function<VV, V> vertexMapper, @NonNull Function<AA, A> arrowMapper) Adds the source graph to the target graph.<V,A> @NonNull MutableDirectedGraph <V, A> DirectedGraphBuilder.inverseOfDirectedGraph(@NonNull DirectedGraph<V, A> graph) Creates a builder which contains a copy of the specified graph with all arrows inverted.<V,A> @NonNull MutableDirectedGraph <V, A> DirectedGraphBuilder.subsetOfDirectedGraph(@NonNull DirectedGraph<V, A> graph, @NonNull Predicate<V> vertexPredicate) Creates a builder which contains the specified vertices, and only arrows from the directed graph, for the specified vertices.Constructors in org.jhotdraw8.graph with parameters of type DirectedGraphModifierConstructorDescriptionCreates a new instance from the specified graph.Creates a new instance from the specified graph.Creates a new instance with a copy of the provided graphCreates a new instance which contains a copy of the specified graph.SimpleMutableDirectedGraph(@NonNull DirectedGraph<VV, AA> graph, @NonNull Function<VV, V> vertexMapper, @NonNull Function3<VV, VV, AA, A> arrowMapper) Creates a new instance which contains a copy of the specified graph. -
Uses of DirectedGraph in org.jhotdraw8.graph.algo
Methods in org.jhotdraw8.graph.algo with parameters of type DirectedGraphModifier and TypeMethodDescriptionDisjointSetsAlgo.findDisjointSets(@NonNull DirectedGraph<V, A> graph) Given a directed graph, returns all disjoint sets of vertices.<V,A, C extends Number & Comparable<C>>
@NonNull SimpleMutableDirectedGraph<V, A> MinimumSpanningTreeAlgo.findMinimumSpanningTreeGraph(@NonNull DirectedGraph<V, A> graph, @NonNull Function<A, C> costf) Given an undirected graph and a cost function, returns a builder with the minimum spanning tree.<V,A, C extends Number & Comparable<C>>
@NonNull SimpleMutableDirectedGraph<V, A> MinimumSpanningTreeAlgo.findMinimumSpanningTreeGraph(@NonNull DirectedGraph<V, A> graph, @NonNull Function3<V, V, A, C> costf) Given an undirected graph and a cost function, returns a builder with the minimum spanning tree.StronglyConnectedComponentsAlgo.findStronglyConnectedComponents(@NonNull DirectedGraph<V, A> graph) Returns all strongly connected components in the specified graph.TopologicalSortAlgo.sortTopologically(DirectedGraph<V, A> m) Sorts the specified directed graph topologically.TopologicalSortAlgo.sortTopologicallyObject(@NonNull DirectedGraph<V, A> model) Sorts the specified directed graph topologically. -
Uses of DirectedGraph in org.jhotdraw8.graph.io
Methods in org.jhotdraw8.graph.io with parameters of type DirectedGraphModifier and TypeMethodDescription<V,A> void AdjacencyListWriter.write(@NonNull Appendable w, @NonNull DirectedGraph<V, A> graph) Dumps the graph for debugging purposes.<V,A> void AdjacencyListWriter.write(@NonNull Appendable w, @NonNull DirectedGraph<V, A> graph, @NonNull Function<V, String> toStringFunction) Dumps the graph for debugging purposes.<V,A> String AdjacencyListWriter.write(@NonNull DirectedGraph<V, A> graph) Dumps the graph for debugging purposes.<V,A> void GraphvizWriter.write(@NonNull Appendable w, @NonNull DirectedGraph<V, A> graph) Dumps a directed graph into a String which can be rendered with the graphviz "dot" tool.<V,A> void GraphvizWriter.write(@NonNull Appendable w, @NonNull DirectedGraph<V, A> graph, @NonNull Function<V, String> vertexToString) Dumps a directed graph into a String which can be rendered with the graphviz "dot" tool.<V,A> void GraphvizWriter.write(@NonNull Appendable w, @NonNull DirectedGraph<V, A> graph, @NonNull Function<V, String> vertexToString, @Nullable Function<V, String> vertexAttributes, @Nullable Function<A, String> arrowAttributes, @Nullable String graphId) Dumps a directed graph into a String which can be rendered with the graphviz "dot" tool.<V,A> String GraphvizWriter.write(@NonNull DirectedGraph<V, A> graph) Dumps the graph graph into a String which can be rendered with the graphviz "dot" tool.<V,A> String GraphvizWriter.write(@NonNull DirectedGraph<V, A> graph, @NonNull Function<V, String> vertexToString, @NonNull Function<V, String> vertexAttributes, @NonNull Function<A, String> arrowAttributes) Dumps a directed graph into a String which can be rendered with the graphviz "dot" tool.