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.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()
          Retrieves the flow graph used to compute the max flow
 

Constructors in edu.uci.ics.jung.algorithms.flows with parameters of type DirectedGraph
EdmondsKarpMaxFlow(DirectedGraph<V,E> directedGraph, V source, V sink,  edgeCapacityTransformer, Map<E,Number> edgeFlowMap,  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
 

Methods in edu.uci.ics.jung.algorithms.importance with parameters of type DirectedGraph
protected  void PageRank.initialize(DirectedGraph<V,E> graph, double bias, Map<E,Number> edgeWeights)
          Deprecated.  
 

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)
           
PageRank(DirectedGraph<V,E> graph, double bias)
          Deprecated. Basic constructor which initializes the algorithm
PageRank(DirectedGraph<V,E> graph, double bias, Map<E,Number> edgeWeights)
          Deprecated. Specialized constructor that allows the user to specify an edge key if edges already have user-defined weights assigned to them.
PageRank(DirectedGraph<V,E> graph, double bias, Map<E,Number> edgeWeights, Pair<Set<V>> reachables)
          Deprecated.  
PageRankWithPriors(DirectedGraph<V,E> graph, double beta, Set<V> priors, Map<E,Number> edgeWeights)
          Deprecated. Constructs an instance of the ranker.
WeightedNIPaths(DirectedGraph<V,E> graph,  vertexFactory,  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.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.
 

Constructors in edu.uci.ics.jung.graph with parameters of type DirectedGraph
DelegateForest(DirectedGraph<V,E> delegate)
           
 

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.
 



Copyright © 2008 null. All Rights Reserved.