Package | Description |
---|---|
edu.uci.ics.jung.algorithms.cluster |
Mechanisms for identifying clusters in graphs.
|
edu.uci.ics.jung.algorithms.generators.random |
Methods for generating random graphs with various 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 |
---|---|
Set<Set<V>> |
BicomponentClusterer.apply(UndirectedGraph<V,E> theGraph)
Extracts the bicomponents from the graph.
|
protected void |
BicomponentClusterer.findBiconnectedComponents(UndirectedGraph<V,E> g,
V v,
Set<Set<V>> bicomponents)
Stores, in
bicomponents , all the biconnected
components that are reachable from v . |
Constructor and Description |
---|
ErdosRenyiGenerator(com.google.common.base.Supplier<UndirectedGraph<V,E>> graphFactory,
com.google.common.base.Supplier<V> vertexFactory,
com.google.common.base.Supplier<E> edgeFactory,
int numVertices,
double p) |
Modifier and Type | Method and Description |
---|---|
static <V,E> UndirectedGraph<V,E> |
DirectionTransformer.toUndirected(Graph<V,E> graph,
com.google.common.base.Supplier<UndirectedGraph<V,E>> graph_factory,
com.google.common.base.Supplier<E> edge_factory,
boolean create_new)
Transforms
graph (which may be of any directionality)
into an undirected graph. |
Modifier and Type | Method and Description |
---|---|
static <V,E> UndirectedGraph<V,E> |
DirectionTransformer.toUndirected(Graph<V,E> graph,
com.google.common.base.Supplier<UndirectedGraph<V,E>> graph_factory,
com.google.common.base.Supplier<E> edge_factory,
boolean create_new)
Transforms
graph (which may be of any directionality)
into an undirected graph. |
Modifier and Type | Class and Description |
---|---|
class |
UndirectedOrderedSparseMultigraph<V,E>
An implementation of
UndirectedGraph that is suitable for sparse graphs,
orders its vertex and edge collections according to insertion time, and permits
parallel edges. |
class |
UndirectedSparseGraph<V,E>
An implementation of
UndirectedGraph that is suitable
for sparse graphs. |
class |
UndirectedSparseMultigraph<V,E>
An implementation of
UndirectedGraph that is suitable for
sparse graphs and permits parallel edges. |
Modifier and Type | Method and Description |
---|---|
static <V,E> com.google.common.base.Supplier<UndirectedGraph<V,E>> |
UndirectedSparseMultigraph.getFactory() |
static <V,E> com.google.common.base.Supplier<UndirectedGraph<V,E>> |
UndirectedSparseGraph.getFactory() |
static <V,E> com.google.common.base.Supplier<UndirectedGraph<V,E>> |
UndirectedOrderedSparseMultigraph.getFactory() |
Modifier and Type | Method and Description |
---|---|
static <V,E> UndirectedGraph<V,E> |
Graphs.synchronizedUndirectedGraph(UndirectedGraph<V,E> graph)
Returns a synchronized UndirectedGraph backed by the passed UndirectedGraph.
|
static <V,E> UndirectedGraph<V,E> |
Graphs.unmodifiableUndirectedGraph(UndirectedGraph<V,E> graph)
Returns an unmodifiable
UndirectedGraph backed by the passed graph. |
Modifier and Type | Method and Description |
---|---|
static <V,E> UndirectedGraph<V,E> |
Graphs.synchronizedUndirectedGraph(UndirectedGraph<V,E> graph)
Returns a synchronized UndirectedGraph backed by the passed UndirectedGraph.
|
static <V,E> UndirectedGraph<V,E> |
Graphs.unmodifiableUndirectedGraph(UndirectedGraph<V,E> graph)
Returns an unmodifiable
UndirectedGraph backed by the passed graph. |
Copyright © 2015. All rights reserved.