Uses of Interface
edu.uci.ics.jung.graph.UndirectedGraph

Packages that use UndirectedGraph

edu.uci.ics.jung.algorithms	Provides a set of specialized algorithms for computing various measures on graphs as well as transforming graphs in different ways.
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.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.

Uses of UndirectedGraph in edu.uci.ics.jung.algorithms

Methods in edu.uci.ics.jung.algorithms with parameters of type UndirectedGraph

static DoubleMatrix2D

GraphMatrixOperations.computeVoltagePotentialMatrix(UndirectedGraph graph) The idea here is based on the metaphor of an electric circuit.

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 g)
Constructor which initializes the algorithm

RandomWalkSTBetweenness(UndirectedGraph g, Vertex s, Vertex t)
Constructor which initializes the algorithm

Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.transformation

Methods in edu.uci.ics.jung.algorithms.transformation that return UndirectedGraph

static UndirectedGraph	DirectionTransformer.toUndirected(Graph graph) Transforms graph (which may be of any directionality) into an undirected graph without parallel edges.
static UndirectedGraph	DirectionTransformer.toUndirected(Graph graph, boolean copy) Transforms graph (which may be of any directionality) into an undirected graph.

Uses of UndirectedGraph in edu.uci.ics.jung.graph.impl

Classes in edu.uci.ics.jung.graph.impl that implement UndirectedGraph

class	BipartiteGraph A Bipartite graph is divided into A vertices and B vertices.
class	UndirectedSparseGraph An implementation of Graph that consists of a Vertex set and an UndirectedEdge set.

Uses of UndirectedGraph in edu.uci.ics.jung.utils

Methods in edu.uci.ics.jung.utils that return UndirectedGraph

static UndirectedGraph

GraphUtils.transform(DirectedGraph dGraph) Deprecated. As of version 1.4, replaced by DirectionTransformer.toUndirected(Graph)