Uses of Interface
edu.uci.ics.jung.graph.UndirectedGraph
-
Packages that use UndirectedGraph 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. -
-
Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.cluster
Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type UndirectedGraph Modifier and Type Method Description java.util.Set<java.util.Set<V>>
BicomponentClusterer. apply(UndirectedGraph<V,E> theGraph)
Extracts the bicomponents from the graph.protected void
BicomponentClusterer. findBiconnectedComponents(UndirectedGraph<V,E> g, V v, java.util.Set<java.util.Set<V>> bicomponents)
Stores, inbicomponents
, all the biconnected components that are reachable fromv
. -
Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.generators.random
Fields in edu.uci.ics.jung.algorithms.generators.random with type parameters of type UndirectedGraph Modifier and Type Field Description (package private) com.google.common.base.Supplier<UndirectedGraph<V,E>>
ErdosRenyiGenerator. graphFactory
Constructor parameters in edu.uci.ics.jung.algorithms.generators.random with type arguments of type UndirectedGraph Constructor 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)
-
Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.transformation
Methods in edu.uci.ics.jung.algorithms.transformation that return UndirectedGraph Modifier and Type Method 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)
Transformsgraph
(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 Modifier and Type Method 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)
Transformsgraph
(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 Modifier and Type Class Description class
UndirectedOrderedSparseMultigraph<V,E>
An implementation ofUndirectedGraph
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 ofUndirectedGraph
that is suitable for sparse graphs.class
UndirectedSparseMultigraph<V,E>
An implementation ofUndirectedGraph
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 Modifier and Type Method Description static <V,E>
com.google.common.base.Supplier<UndirectedGraph<V,E>>UndirectedOrderedSparseMultigraph. 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>>UndirectedSparseMultigraph. getFactory()
-
Uses of UndirectedGraph in edu.uci.ics.jung.graph.util
Classes in edu.uci.ics.jung.graph.util that implement UndirectedGraph Modifier and Type Class Description (package private) static class
Graphs.SynchronizedUndirectedGraph<V,E>
(package private) static class
Graphs.UnmodifiableUndirectedGraph<V,E>
Methods in edu.uci.ics.jung.graph.util that return UndirectedGraph Modifier and Type Method 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 unmodifiableUndirectedGraph
backed by the passed graph.Methods in edu.uci.ics.jung.graph.util with parameters of type UndirectedGraph Modifier and Type Method 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 unmodifiableUndirectedGraph
backed by the passed graph.Constructors in edu.uci.ics.jung.graph.util with parameters of type UndirectedGraph Constructor Description SynchronizedUndirectedGraph(UndirectedGraph<V,E> delegate)
UnmodifiableUndirectedGraph(UndirectedGraph<V,E> delegate)
-