Package | Description |
---|---|
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 |
Modifier and Type | Method and Description |
---|---|
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.
|
protected void |
ExactFlowCommunity.initializeFlowGraph(DirectedGraph flowGraph,
Vertex source,
Vertex sink,
java.util.Set rootSet)
Initialize the flow graph
|
Modifier and Type | Method and Description |
---|---|
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.
|
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.
|
Modifier and Type | Method and Description |
---|---|
DirectedGraph |
EdmondsKarpMaxFlow.getFlowGraph()
Retrieves the flow graph used to compute the max flow
|
Constructor and Description |
---|
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.
|
Modifier and Type | Method and Description |
---|---|
protected void |
PageRank.initialize(DirectedGraph graph,
double bias,
java.lang.String edgeWeightKeyName) |
Constructor and Description |
---|
KStepMarkov(DirectedGraph graph,
java.util.Set priors,
int k,
java.lang.String edgeWeightKeyName)
Construct the algorihm instance and initializes the algorithm.
|
MarkovCentrality(DirectedGraph graph,
java.util.Set rootNodes) |
MarkovCentrality(DirectedGraph graph,
java.util.Set rootNodes,
java.lang.String edgeWeightKey) |
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.
|
PageRank(DirectedGraph graph,
double bias,
java.lang.String edgeWeightKeyName,
Pair reachables) |
PageRankWithPriors(DirectedGraph graph,
double beta,
java.util.Set priors,
java.lang.String edgeWeightKeyName)
Constructs an instance of the ranker.
|
WeightedNIPaths(DirectedGraph graph,
double alpha,
int maxDepth,
java.util.Set priors)
Constructs and initializes the algorithm.
|
Modifier and Type | Method and Description |
---|---|
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 . |
Modifier and Type | Method and Description |
---|---|
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. |
Modifier and Type | Class and Description |
---|---|
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. |
Modifier and Type | Method and Description |
---|---|
static DirectedGraph |
GraphUtils.transform(Graph uGraph)
Deprecated.
As of version 1.4, replaced by
DirectionTransformer.toDirected(Graph) |
Modifier and Type | Method and Description |
---|---|
static UndirectedGraph |
GraphUtils.transform(DirectedGraph dGraph)
Deprecated.
As of version 1.4, replaced by
DirectionTransformer.toUndirected(Graph) |
Modifier and Type | Method and Description |
---|---|
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 . |
Modifier and Type | Method and Description |
---|---|
DirectedGraph |
GraphCollapser.collapseNext() |
Constructor and Description |
---|
GraphCollapser(DirectedGraph g,
java.util.Set rootSet,
int maxIntermediateSetSize,
java.lang.String edgeWeightKey) |
Modifier and Type | Method and Description |
---|---|
DirectedGraph |
TestMatrixFile.createSimpleDirectedGraph() |