Package | Description |
---|---|
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.
|
Modifier and Type | Method and Description |
---|---|
DirectedGraph<V,E> |
EdmondsKarpMaxFlow.getFlowGraph() |
Constructor and Description |
---|
EdmondsKarpMaxFlow(DirectedGraph<V,E> directedGraph,
V source,
V sink,
com.google.common.base.Function<E,Number> edgeCapacityTransformer,
Map<E,Number> edgeFlowMap,
com.google.common.base.Supplier<E> edgeFactory)
Constructs a new instance of the algorithm solver for a given graph, source, and sink.
|
Constructor and Description |
---|
KStepMarkov(DirectedGraph<V,E> graph,
Set<V> priors,
int k,
Map<E,Number> edgeWeights)
Construct the algorihm instance and initializes the algorithm.
|
WeightedNIPaths(DirectedGraph<V,E> graph,
com.google.common.base.Supplier<V> vertexFactory,
com.google.common.base.Supplier<E> edgeFactory,
double alpha,
int maxDepth,
Set<V> priors)
Constructs and initializes the algorithm.
|
Modifier and Type | Method and Description |
---|---|
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 . |
Modifier and Type | Method and Description |
---|---|
static <V,E> Graph<V,E> |
DirectionTransformer.toDirected(Graph<V,E> graph,
com.google.common.base.Supplier<DirectedGraph<V,E>> graph_factory,
com.google.common.base.Supplier<E> edge_factory,
boolean create_new)
Transforms
graph (which may be of any directionality)
into a directed graph. |
Modifier and Type | Interface and Description |
---|---|
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. |
Modifier and Type | Class and Description |
---|---|
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. |
Modifier and Type | Method and Description |
---|---|
static <V,E> com.google.common.base.Supplier<DirectedGraph<V,E>> |
DirectedSparseMultigraph.getFactory() |
static <V,E> com.google.common.base.Supplier<DirectedGraph<V,E>> |
DirectedSparseGraph.getFactory() |
static <V,E> com.google.common.base.Supplier<DirectedGraph<V,E>> |
DirectedOrderedSparseMultigraph.getFactory() |
static <V,E> com.google.common.base.Supplier<DirectedGraph<V,E>> |
OrderedKAryTree.getFactory(int order) |
Constructor and Description |
---|
DelegateForest(DirectedGraph<V,E> delegate)
Creates an instance backed by the input
DirectedGraph . |
DelegateTree(DirectedGraph<V,E> graph)
Creates a new
DelegateTree which delegates to graph . |
Constructor and Description |
---|
DelegateTree(com.google.common.base.Supplier<DirectedGraph<V,E>> graphFactory)
create an instance with passed values.
|
Modifier and Type | Method and Description |
---|---|
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. |
Modifier and Type | Method and Description |
---|---|
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 © 2015. All rights reserved.