|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use DirectedGraph | |
---|---|
edu.uci.ics.jung.algorithms.cluster | Provides a series of methods for locating clusters in graphs according to some model-based, heuristic or graph-theoretic criteria. |
edu.uci.ics.jung.algorithms.connectivity | Provides a series of methods for computing various aspects of a graph's overall connectivity structure. |
edu.uci.ics.jung.algorithms.flows | Provides a series of methods for solving the s-t max flow and other network flow problems. |
edu.uci.ics.jung.algorithms.importance | Provides a set of algorithms for computing the importance of each node (or edge)
in a graph relative to all others (or, for the algorithms that inherit from
RelativeAuthorityRanker , relative to a specified subset of elements). |
edu.uci.ics.jung.algorithms.metrics | |
edu.uci.ics.jung.algorithms.transformation | |
edu.uci.ics.jung.graph.impl | Implementations of the JUNG vertex, edge, and graph interfaces. |
edu.uci.ics.jung.utils | Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application. |
scratch.danyel.triads | |
scratch.scott | |
test.edu.uci.ics.jung.io |
Uses of DirectedGraph in edu.uci.ics.jung.algorithms.cluster |
---|
Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type DirectedGraph | |
---|---|
Set |
ExactFlowCommunity.extract(DirectedGraph graph,
Set rootSet)
Extracts the community according to the cohesion threshold |
static Set |
ExactFlowCommunity.extract(DirectedGraph graph,
Set rootSet,
int numIterations)
Implements the "ApproximateFlowCommunity" algorithm. |
protected void |
ExactFlowCommunity.initializeFlowGraph(DirectedGraph flowGraph,
Vertex source,
Vertex sink,
Set rootSet)
Initialize the flow graph |
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.extractInDirectedNeighborhood(DirectedGraph graph,
Set rootNodes,
int radiusK)
Extracts the subgraph comprised of all vertices within distance K (in-directed) from any node in rootNodes. |
static Graph |
KNeighborhoodExtractor.extractOutDirectedNeighborhood(DirectedGraph graph,
Set rootNodes,
int radiusK)
Extracts the subgraph comprised of all vertices within distance K (out-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,
String edgeCapacityKey,
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 |
---|
Methods in edu.uci.ics.jung.algorithms.importance with parameters of type DirectedGraph | |
---|---|
protected void |
PageRank.initialize(DirectedGraph graph,
double bias,
String edgeWeightKeyName)
|
Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type DirectedGraph | |
---|---|
KStepMarkov(DirectedGraph graph,
Set priors,
int k,
String edgeWeightKeyName)
Construct the algorihm instance and initializes the algorithm. |
|
MarkovCentrality(DirectedGraph graph,
Set rootNodes)
|
|
MarkovCentrality(DirectedGraph graph,
Set rootNodes,
String edgeWeightKey)
|
|
PageRank(DirectedGraph graph,
double bias)
Basic constructor which initializes the algorithm |
|
PageRank(DirectedGraph graph,
double bias,
String edgeWeightKeyName)
Specialized constructor that allows the user to specify an edge key if edges already have user-defined weights assigned to them. |
|
PageRank(DirectedGraph graph,
double bias,
String edgeWeightKeyName,
Pair reachables)
|
|
PageRankWithPriors(DirectedGraph graph,
double beta,
Set priors,
String edgeWeightKeyName)
Constructs an instance of the ranker. |
|
WeightedNIPaths(DirectedGraph graph,
double alpha,
int maxDepth,
Set 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 long[] |
TriadicCensus.getCounts(DirectedGraph 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 |
---|
Methods in edu.uci.ics.jung.algorithms.transformation that return DirectedGraph | |
---|---|
static DirectedGraph |
DirectionTransformer.toDirected(Graph graph)
Transforms graph (which may be of any directionality)
into a directed graph without
parallel edges. |
static DirectedGraph |
DirectionTransformer.toDirected(Graph graph,
boolean copy)
Transforms graph (which may be of any directionality)
into a directed graph. |
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 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 DirectionTransformer.toUndirected(Graph) |
Uses of DirectedGraph in scratch.danyel.triads |
---|
Methods in scratch.danyel.triads with parameters of type DirectedGraph | |
---|---|
static long[] |
TriadicCensus.getCounts(DirectedGraph 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 scratch.scott |
---|
Methods in scratch.scott that return DirectedGraph | |
---|---|
DirectedGraph |
GraphCollapser.collapseNext()
|
Constructors in scratch.scott with parameters of type DirectedGraph | |
---|---|
GraphCollapser(DirectedGraph g,
Set rootSet,
int maxIntermediateSetSize,
String edgeWeightKey)
|
Uses of DirectedGraph in test.edu.uci.ics.jung.io |
---|
Methods in test.edu.uci.ics.jung.io that return DirectedGraph | |
---|---|
DirectedGraph |
TestMatrixFile.createSimpleDirectedGraph()
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |