Uses of Interface
org.jgrapht.UndirectedGraph

Packages that use UndirectedGraph

Package	Description
org.jgrapht	The front-end API's interfaces and classes, including Graph, DirectedGraph and UndirectedGraph.
org.jgrapht.alg	Algorithms provided with JGraphT.
org.jgrapht.alg.cycle	Algorithms for enumeration of simple cycles in graphs.
org.jgrapht.alg.util	Utilities used by JGraphT algorithms.
org.jgrapht.graph	Implementations of various graphs.

Uses of UndirectedGraph in org.jgrapht

Methods in org.jgrapht that return UndirectedGraph

Modifier and Type	Method and Description
static <V,E> UndirectedGraph<V,E>	Graphs.undirectedGraph(Graph<V,E> g) Returns an undirected view of the specified graph.

Uses of UndirectedGraph in org.jgrapht.alg

Classes in org.jgrapht.alg that implement UndirectedGraph

Modifier and Type	Class and Description
class	BlockCutpointGraph<V,E> Definition of a block of a graph in MathWorld. Definition and lemma taken from the article Structure-Based Resilience Metrics for Service-Oriented Networks: Definition 4.5 Let G(V; E) be a connected undirected graph.

Methods in org.jgrapht.alg that return UndirectedGraph

Modifier and Type	Method and Description
UndirectedGraph<V,E>	BlockCutpointGraph.getBlock(V vertex) Returns the vertex if vertex is a cutpoint, and otherwise returns the block (biconnected component) containing the vertex.

Methods in org.jgrapht.alg with parameters of type UndirectedGraph

Modifier and Type	Method and Description
static <V,E> int	ChromaticNumber.findGreedyChromaticNumber(UndirectedGraph<V,E> g) Finds the number of colors required for a greedy coloring of the graph.
static <V,E> Map<Integer,Set<V>>	ChromaticNumber.findGreedyColoredGroups(UndirectedGraph<V,E> g) Finds a greedy coloring of the graph.
static <V,E> Set<V>	VertexCovers.findGreedyCover(UndirectedGraph<V,E> g) Finds a greedy approximation for a minimal vertex cover of a specified graph.
Set<E>	EdmondsBlossomShrinking.findMatch(UndirectedGraph<V,E> g) Deprecated.
static <V,E> List<V>	EulerianCircuit.getEulerianCircuitVertices(UndirectedGraph<V,E> g) This method will return a list of vertices which represents the Eulerian circuit of the graph.
static <V,E> boolean	EulerianCircuit.isEulerian(UndirectedGraph<V,E> g) This method will check whether the graph passed in is Eulerian or not.

Constructors in org.jgrapht.alg with parameters of type UndirectedGraph

Constructor and Description
BiconnectivityInspector(UndirectedGraph<V,E> graph) Running time = O(m) where m is the number of edges.
BlockCutpointGraph(UndirectedGraph<V,E> graph) Running time = O(m) where m is the number of edges.
ConnectivityInspector(UndirectedGraph<V,E> g) Creates a connectivity inspector for the specified undirected graph.
EdmondsBlossomShrinking(UndirectedGraph<V,E> G)
HopcroftKarpBipartiteMatching(UndirectedGraph<V,E> graph, Set<V> partition1, Set<V> partition2)
StoerWagnerMinimumCut(UndirectedGraph<V,E> graph) Will compute the minimum cut in graph.

Uses of UndirectedGraph in org.jgrapht.alg.cycle

Methods in org.jgrapht.alg.cycle that return UndirectedGraph

Modifier and Type	Method and Description
UndirectedGraph<V,E>	UndirectedCycleBase.getGraph() Returns the graph on which the cycle base search algorithm is executed by this object.
UndirectedGraph<V,E>	PatonCycleBase.getGraph() Returns the graph on which the cycle base search algorithm is executed by this object.

Methods in org.jgrapht.alg.cycle with parameters of type UndirectedGraph

Modifier and Type	Method and Description
void	UndirectedCycleBase.setGraph(UndirectedGraph<V,E> graph) Sets the graph on which the cycle base search algorithm is executed by this object.
void	PatonCycleBase.setGraph(UndirectedGraph<V,E> graph) Sets the graph on which the cycle base search algorithm is executed by this object.

Constructors in org.jgrapht.alg.cycle with parameters of type UndirectedGraph

Constructor and Description
PatonCycleBase(UndirectedGraph<V,E> graph) Create a cycle base finder for the specified graph.

Uses of UndirectedGraph in org.jgrapht.alg.util

Constructors in org.jgrapht.alg.util with parameters of type UndirectedGraph

Constructor and Description
VertexDegreeComparator(UndirectedGraph<V,E> g) Creates a comparator for comparing the degrees of vertices in the specified graph.
VertexDegreeComparator(UndirectedGraph<V,E> g, boolean ascendingOrder) Creates a comparator for comparing the degrees of vertices in the specified graph.

Uses of UndirectedGraph in org.jgrapht.graph

Classes in org.jgrapht.graph that implement UndirectedGraph

Modifier and Type	Class and Description
class	AsUndirectedGraph<V,E> An undirected view of the backing directed graph specified in the constructor.
class	ListenableUndirectedGraph<V,E> An undirected graph which is also ListenableGraph.
class	ListenableUndirectedWeightedGraph<V,E> An undirected weighted graph which is also ListenableGraph.
class	Multigraph<V,E> A multigraph.
class	Pseudograph<V,E> A pseudograph.
class	SimpleGraph<V,E> A simple graph.
class	SimpleWeightedGraph<V,E> A simple weighted graph.
class	UndirectedGraphUnion<V,E>
class	UndirectedMaskSubgraph<V,E> An undirected graph that is a MaskSubgraph on another graph.
class	UndirectedSubgraph<V,E> An undirected graph that is a subgraph on other graph.
class	UndirectedWeightedSubgraph<V,E> An undirected weighted graph that is a subgraph on other graph.
class	UnmodifiableUndirectedGraph<V,E> An undirected graph that cannot be modified.
class	WeightedMultigraph<V,E> A weighted multigraph.
class	WeightedPseudograph<V,E> A weighted pseudograph.

Constructors in org.jgrapht.graph with parameters of type UndirectedGraph

Constructor and Description
ListenableUndirectedGraph(UndirectedGraph<V,E> base) Creates a new listenable undirected graph.
UndirectedMaskSubgraph(UndirectedGraph<V,E> base, MaskFunctor<V,E> mask)
UndirectedSubgraph(UndirectedGraph<V,E> base, Set<V> vertexSubset, Set<E> edgeSubset) Creates a new undirected subgraph.
UnmodifiableUndirectedGraph(UndirectedGraph<V,E> g) Creates a new unmodifiable undirected graph based on the specified backing graph.