Uses of Interface
edu.uci.ics.jung.graph.DirectedGraph
-
Packages that use DirectedGraph Package Description edu.uci.ics.jung.algorithms.flows Methods for calculating properties relating to network flows (such as max flow/min cut).edu.uci.ics.jung.algorithms.importance edu.uci.ics.jung.algorithms.metrics Specialized measures for graph properties.edu.uci.ics.jung.algorithms.transformation Mechanisms for graph transformation.edu.uci.ics.jung.graph Interfaces for the JUNG graph types, and some representative implementations.edu.uci.ics.jung.graph.util Utility interfaces and classes for the JUNG API.edu.uci.ics.jung.samples Sample applications created using JUNG, largely focused on visualization. -
-
Uses of DirectedGraph in edu.uci.ics.jung.algorithms.flows
Fields in edu.uci.ics.jung.algorithms.flows declared as DirectedGraph Modifier and Type Field Description private DirectedGraph<V,E>
EdmondsKarpMaxFlow. mFlowGraph
private DirectedGraph<V,E>
EdmondsKarpMaxFlow. mOriginalGraph
Methods in edu.uci.ics.jung.algorithms.flows that return DirectedGraph Modifier and Type Method Description DirectedGraph<V,E>
EdmondsKarpMaxFlow. getFlowGraph()
Constructors in edu.uci.ics.jung.algorithms.flows with parameters of type DirectedGraph Constructor Description EdmondsKarpMaxFlow(DirectedGraph<V,E> directedGraph, V source, V sink, com.google.common.base.Function<E,java.lang.Number> edgeCapacityTransformer, java.util.Map<E,java.lang.Number> edgeFlowMap, com.google.common.base.Supplier<E> edgeFactory)
Constructs a new instance of the algorithm solver for a given graph, source, and sink. -
Uses of DirectedGraph in edu.uci.ics.jung.algorithms.importance
Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type DirectedGraph Constructor Description KStepMarkov(DirectedGraph<V,E> graph, java.util.Set<V> priors, int k, java.util.Map<E,java.lang.Number> edgeWeights)
Construct the algorihm instance and initializes the algorithm.WeightedNIPaths(DirectedGraph<V,E> graph, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, double alpha, int maxDepth, java.util.Set<V> priors)
Constructs and initializes the algorithm. -
Uses of DirectedGraph in edu.uci.ics.jung.algorithms.metrics
Methods in edu.uci.ics.jung.algorithms.metrics with parameters of type DirectedGraph Modifier and Type Method Description static <V,E>
long[]TriadicCensus. getCounts(DirectedGraph<V,E> g)
Returns an array whose ith element (for i in [1,16]) is the number of occurrences of the corresponding triad type ing
. -
Uses of DirectedGraph in edu.uci.ics.jung.algorithms.transformation
Method parameters in edu.uci.ics.jung.algorithms.transformation with type arguments of type DirectedGraph Modifier and Type Method Description static <V,E>
Graph<V,E>DirectionTransformer. toDirected(Graph<V,E> graph, com.google.common.base.Supplier<DirectedGraph<V,E>> graph_factory, com.google.common.base.Supplier<E> edge_factory, boolean create_new)
Transformsgraph
(which may be of any directionality) into a directed graph. -
Uses of DirectedGraph in edu.uci.ics.jung.graph
Subinterfaces of DirectedGraph in edu.uci.ics.jung.graph Modifier and Type Interface Description interface
Forest<V,E>
An interface for a graph which consists of a collection of rooted directed acyclic graphs.interface
Tree<V,E>
A subtype ofGraph
which is a (directed, rooted) tree.Classes in edu.uci.ics.jung.graph that implement DirectedGraph Modifier and Type Class Description class
DelegateForest<V,E>
An implementation ofForest
that delegates to a specifiedDirectedGraph
instance.class
DelegateTree<V,E>
An implementation ofTree
that delegates to a specified instance ofDirectedGraph
.class
DirectedOrderedSparseMultigraph<V,E>
An implementation ofDirectedGraph
, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.class
DirectedSparseGraph<V,E>
An implementation ofDirectedGraph
suitable for sparse graphs.class
DirectedSparseMultigraph<V,E>
An implementation ofDirectedGraph
, suitable for sparse graphs, that permits parallel edges.class
OrderedKAryTree<V,E>
An implementation ofTree
in which each vertex has ≤ k children.Methods in edu.uci.ics.jung.graph that return types with arguments of type DirectedGraph Modifier and Type Method Description static <V,E>
com.google.common.base.Supplier<DirectedGraph<V,E>>DirectedOrderedSparseMultigraph. getFactory()
static <V,E>
com.google.common.base.Supplier<DirectedGraph<V,E>>DirectedSparseGraph. getFactory()
static <V,E>
com.google.common.base.Supplier<DirectedGraph<V,E>>DirectedSparseMultigraph. getFactory()
static <V,E>
com.google.common.base.Supplier<DirectedGraph<V,E>>OrderedKAryTree. getFactory(int order)
Constructors in edu.uci.ics.jung.graph with parameters of type DirectedGraph Constructor Description DelegateForest(DirectedGraph<V,E> delegate)
Creates an instance backed by the inputDirectedGraph
.DelegateTree(DirectedGraph<V,E> graph)
Creates a newDelegateTree
which delegates tograph
.Constructor parameters in edu.uci.ics.jung.graph with type arguments of type DirectedGraph Constructor Description DelegateTree(com.google.common.base.Supplier<DirectedGraph<V,E>> graphFactory)
create an instance with passed values. -
Uses of DirectedGraph in edu.uci.ics.jung.graph.util
Classes in edu.uci.ics.jung.graph.util that implement DirectedGraph Modifier and Type Class Description (package private) static class
Graphs.SynchronizedDirectedGraph<V,E>
(package private) static class
Graphs.SynchronizedForest<V,E>
(package private) static class
Graphs.SynchronizedTree<V,E>
(package private) static class
Graphs.UnmodifiableDirectedGraph<V,E>
(package private) static class
Graphs.UnmodifiableForest<V,E>
(package private) static class
Graphs.UnmodifiableTree<V,E>
Methods in edu.uci.ics.jung.graph.util that return DirectedGraph Modifier and Type Method Description static <V,E>
DirectedGraph<V,E>Graphs. synchronizedDirectedGraph(DirectedGraph<V,E> graph)
Returns a synchronized DirectedGraph backed by the passed DirectedGraph.static <V,E>
DirectedGraph<V,E>Graphs. unmodifiableDirectedGraph(DirectedGraph<V,E> graph)
Returns an unmodifiableDirectedGraph
backed by the passed graph.Methods in edu.uci.ics.jung.graph.util with parameters of type DirectedGraph Modifier and Type Method Description static <V,E>
DirectedGraph<V,E>Graphs. synchronizedDirectedGraph(DirectedGraph<V,E> graph)
Returns a synchronized DirectedGraph backed by the passed DirectedGraph.static <V,E>
DirectedGraph<V,E>Graphs. unmodifiableDirectedGraph(DirectedGraph<V,E> graph)
Returns an unmodifiableDirectedGraph
backed by the passed graph.Constructors in edu.uci.ics.jung.graph.util with parameters of type DirectedGraph Constructor Description SynchronizedDirectedGraph(DirectedGraph<V,E> delegate)
UnmodifiableDirectedGraph(DirectedGraph<V,E> delegate)
-
Uses of DirectedGraph in edu.uci.ics.jung.samples
Fields in edu.uci.ics.jung.samples declared as DirectedGraph Modifier and Type Field Description (package private) DirectedGraph<java.lang.Number,java.lang.Number>
ImageEdgeLabelDemo. graph
the graphFields in edu.uci.ics.jung.samples with type parameters of type DirectedGraph Modifier and Type Field Description (package private) com.google.common.base.Supplier<DirectedGraph<java.lang.String,java.lang.Integer>>
BalloonLayoutDemo. graphFactory
(package private) com.google.common.base.Supplier<DirectedGraph<java.lang.String,java.lang.Integer>>
L2RTreeLayoutDemo. graphFactory
(package private) com.google.common.base.Supplier<DirectedGraph<java.lang.String,java.lang.Integer>>
RadialTreeLensDemo. graphFactory
(package private) com.google.common.base.Supplier<DirectedGraph<java.lang.String,java.lang.Integer>>
TreeCollapseDemo. graphFactory
(package private) com.google.common.base.Supplier<DirectedGraph<java.lang.String,java.lang.Integer>>
TreeLayoutDemo. graphFactory
-