Uses of Interface
edu.uci.ics.jung.graph.DirectedGraph

Packages that use DirectedGraph

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.

Uses of DirectedGraph in edu.uci.ics.jung.algorithms.flows

Methods in edu.uci.ics.jung.algorithms.flows that return DirectedGraph

DirectedGraph<V,E>

EdmondsKarpMaxFlow.getFlowGraph() Returns the graph for which the maximum flow is calculated.

Constructors in edu.uci.ics.jung.algorithms.flows with parameters of type DirectedGraph

EdmondsKarpMaxFlow(DirectedGraph<V,E> directedGraph, V source, V sink, org.apache.commons.collections15.Transformer<E,Number> edgeCapacityTransformer, Map<E,Number> edgeFlowMap, org.apache.commons.collections15.Factory<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

KStepMarkov(DirectedGraph<V,E> graph, Set<V> priors, int k, Map<E,Number> edgeWeights)
Construct the algorihm instance and initializes the algorithm.

MarkovCentrality(DirectedGraph<V,E> graph, Set<V> rootNodes)

MarkovCentrality(DirectedGraph<V,E> graph, Set<V> rootNodes, Map<E,Number> edgeWeightKey)

WeightedNIPaths(DirectedGraph<V,E> graph, org.apache.commons.collections15.Factory<V> vertexFactory, org.apache.commons.collections15.Factory<E> edgeFactory, double alpha, int maxDepth, 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

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 in g.

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

static <V,E> Graph<V,E>

DirectionTransformer.toDirected(Graph<V,E> graph, org.apache.commons.collections15.Factory<DirectedGraph<V,E>> graph_factory, org.apache.commons.collections15.Factory<E> edge_factory, boolean create_new) Transforms graph (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

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 of Graph which is a (directed, rooted) tree.

Classes in edu.uci.ics.jung.graph that implement DirectedGraph

class	DelegateForest<V,E> An implementation of Forest that delegates to a specified DirectedGraph instance.
class	DelegateTree<V,E> An implementation of Tree that delegates to a specified instance of DirectedGraph.
class	DirectedOrderedSparseMultigraph<V,E> An implementation of DirectedGraph, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.
class	DirectedSparseGraph<V,E> An implementation of DirectedGraph suitable for sparse graphs.
class	DirectedSparseMultigraph<V,E> An implementation of DirectedGraph, suitable for sparse graphs, that permits parallel edges.
class	OrderedKAryTree<V,E> An implementation of Tree in which each vertex has <= k children.

Methods in edu.uci.ics.jung.graph that return types with arguments of type DirectedGraph

static <V,E> org.apache.commons.collections15.Factory<DirectedGraph<V,E>>	DirectedSparseMultigraph.getFactory() Returns a Factory that creates an instance of this graph type.
static <V,E> org.apache.commons.collections15.Factory<DirectedGraph<V,E>>	DirectedSparseGraph.getFactory() Returns a Factory that creates an instance of this graph type.
static <V,E> org.apache.commons.collections15.Factory<DirectedGraph<V,E>>	DirectedOrderedSparseMultigraph.getFactory() Returns a Factory that creates an instance of this graph type.
static <V,E> org.apache.commons.collections15.Factory<DirectedGraph<V,E>>	OrderedKAryTree.getFactory(int order) Returns a Factory that creates an instance of this graph type.

Constructors in edu.uci.ics.jung.graph with parameters of type DirectedGraph

DelegateForest(DirectedGraph<V,E> delegate)
Creates an instance backed by the input DirectedGraph i

DelegateTree(DirectedGraph<V,E> graph)
Creates a new DelegateTree which delegates to graph.

Constructor parameters in edu.uci.ics.jung.graph with type arguments of type DirectedGraph

DelegateTree(org.apache.commons.collections15.Factory<DirectedGraph<V,E>> graphFactory)
create an instance with passed values.

Uses of DirectedGraph in edu.uci.ics.jung.graph.util

Methods in edu.uci.ics.jung.graph.util that return DirectedGraph

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 unmodifiable DirectedGraph backed by the passed graph.

Methods in edu.uci.ics.jung.graph.util with parameters of type DirectedGraph

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 unmodifiable DirectedGraph backed by the passed graph.