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

Packages that use DirectedGraph

edu.uci.ics.jung.algorithms.cluster
edu.uci.ics.jung.algorithms.connectivity
edu.uci.ics.jung.algorithms.flows
edu.uci.ics.jung.algorithms.importance
edu.uci.ics.jung.algorithms.transformation
edu.uci.ics.jung.graph.impl
edu.uci.ics.jung.utils

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

Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type DirectedGraph

java.util.Set	ExactFlowCommunity.extract(DirectedGraph graph, java.util.Set rootSet) Extracts the community according to the cohesion threshold
static java.util.Set	ExactFlowCommunity.extract(DirectedGraph graph, java.util.Set rootSet, int numIterations) Implements the "ApproximateFlowCommunity" algorithm.

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

Methods in edu.uci.ics.jung.algorithms.connectivity with parameters of type DirectedGraph

static Graph	KNeighborhoodExtractor.extractOutDirectedNeighborhood(DirectedGraph graph, java.util.Set rootNodes, int radiusK) Extracts the subgraph comprised of all vertices within distance K (out-directed) from any node in rootNodes.
static Graph	KNeighborhoodExtractor.extractInDirectedNeighborhood(DirectedGraph graph, java.util.Set rootNodes, int radiusK) Extracts the subgraph comprised of all vertices within distance K (in-directed) from any node in rootNodes.

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

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

DirectedGraph

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 directedGraph, Vertex source, Vertex sink, java.lang.String edgeCapacityKey, java.lang.String edgeFlowKey)
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

WeightedNIPaths(DirectedGraph graph, double alpha, int maxDepth, java.util.Set priors)
Constructs and initializes the algorithm.

PageRankWithPriors(DirectedGraph graph, double beta, java.util.Set priors, java.lang.String edgeWeightKeyName)
Constructs an instance of the ranker.

PageRank(DirectedGraph graph, double bias)
Basic constructor which initializes the algorithm

PageRank(DirectedGraph graph, double bias, java.lang.String edgeWeightKeyName)
Specialized constructor that allows the user to specify an edge key if edges already have user-defined weights assigned to them.

MarkovCentrality(DirectedGraph graph, java.util.Set rootNodes)

MarkovCentrality(DirectedGraph graph, java.util.Set rootNodes, java.lang.String edgeWeightKey)

KStepMarkov(DirectedGraph graph, java.util.Set priors, int k, java.lang.String edgeWeightKeyName)
Construct the algorihm instance and initializes the algorithm.

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

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

static DirectedGraph

DirectionTransformer.toDirected(Graph graph) Transforms graph (which may be either undirected or mixed) into a directed graph without parallel edges.

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

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

class	DirectedSparseGraph An implementation of Graph that consists of a Vertex set and a DirectedEdge set.
class	SparseTree An implementation of Graph that consists of a Vertex set and a DirectedEdge set.

Uses of DirectedGraph in edu.uci.ics.jung.utils

Methods in edu.uci.ics.jung.utils that return DirectedGraph

static DirectedGraph

GraphUtils.transform(Graph uGraph) Deprecated. As of version 1.4, replaced by edu.ics.uci.jung.algorithms.transformation.DirectionTransformer#toDirected(Graph)

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

static UndirectedGraph

GraphUtils.transform(DirectedGraph dGraph) Deprecated. As of version 1.4, replaced by edu.ics.uci.jung.algorithms.transformation.DirectionTransformer#toUndirected(Graph)