|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use UndirectedGraph | |
---|---|
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.importance | |
edu.uci.ics.jung.algorithms.matrix | Mechanisms for dealing with graphs as matrices. |
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. |
Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.cluster |
---|
Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type UndirectedGraph | |
---|---|
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 . |
Set<Set<V>> |
BicomponentClusterer.transform(UndirectedGraph<V,E> theGraph)
Extracts the bicomponents from the graph. |
Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.generators.random |
---|
Constructor parameters in edu.uci.ics.jung.algorithms.generators.random with type arguments of type UndirectedGraph | |
---|---|
ErdosRenyiGenerator(org.apache.commons.collections15.Factory<UndirectedGraph<V,E>> graphFactory,
org.apache.commons.collections15.Factory<V> vertexFactory,
org.apache.commons.collections15.Factory<E> edgeFactory,
int numVertices,
double p)
|
Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.importance |
---|
Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type UndirectedGraph | |
---|---|
RandomWalkBetweenness(UndirectedGraph<V,E> g)
Constructor which initializes the algorithm |
|
RandomWalkSTBetweenness(UndirectedGraph<V,E> g,
V s,
V t)
Constructor which initializes the algorithm |
Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.matrix |
---|
Methods in edu.uci.ics.jung.algorithms.matrix with parameters of type UndirectedGraph | ||
---|---|---|
static
|
GraphMatrixOperations.computeVoltagePotentialMatrix(UndirectedGraph<V,E> graph)
The idea here is based on the metaphor of an electric circuit. |
Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.transformation |
---|
Methods in edu.uci.ics.jung.algorithms.transformation that return UndirectedGraph | ||
---|---|---|
static
|
DirectionTransformer.toUndirected(Graph<V,E> graph,
org.apache.commons.collections15.Factory<UndirectedGraph<V,E>> graph_factory,
org.apache.commons.collections15.Factory<E> edge_factory,
boolean create_new)
Transforms graph (which may be of any directionality)
into an undirected graph. |
Method parameters in edu.uci.ics.jung.algorithms.transformation with type arguments of type UndirectedGraph | ||
---|---|---|
static
|
DirectionTransformer.toUndirected(Graph<V,E> graph,
org.apache.commons.collections15.Factory<UndirectedGraph<V,E>> graph_factory,
org.apache.commons.collections15.Factory<E> edge_factory,
boolean create_new)
Transforms graph (which may be of any directionality)
into an undirected graph. |
Uses of UndirectedGraph in edu.uci.ics.jung.graph |
---|
Classes in edu.uci.ics.jung.graph that implement UndirectedGraph | |
---|---|
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. |
Methods in edu.uci.ics.jung.graph that return types with arguments of type UndirectedGraph | ||
---|---|---|
static
|
UndirectedSparseMultigraph.getFactory()
Returns a Factory that creates an instance of this graph type. |
|
static
|
UndirectedSparseGraph.getFactory()
Returns a Factory that creates an instance of this graph type. |
|
static
|
UndirectedOrderedSparseMultigraph.getFactory()
Returns a Factory that creates an instance of this graph type. |
Uses of UndirectedGraph in edu.uci.ics.jung.graph.util |
---|
Methods in edu.uci.ics.jung.graph.util that return UndirectedGraph | ||
---|---|---|
static
|
Graphs.synchronizedUndirectedGraph(UndirectedGraph<V,E> graph)
Returns a synchronized UndirectedGraph backed by the passed UndirectedGraph. |
|
static
|
Graphs.unmodifiableUndirectedGraph(UndirectedGraph<V,E> graph)
Returns an unmodifiable UndirectedGraph backed by the passed graph. |
Methods in edu.uci.ics.jung.graph.util with parameters of type UndirectedGraph | ||
---|---|---|
static
|
Graphs.synchronizedUndirectedGraph(UndirectedGraph<V,E> graph)
Returns a synchronized UndirectedGraph backed by the passed UndirectedGraph. |
|
static
|
Graphs.unmodifiableUndirectedGraph(UndirectedGraph<V,E> graph)
Returns an unmodifiable UndirectedGraph backed by the passed graph. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |