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.interfaces	Algorithm related interfaces.
org.jgrapht.alg.matching	Algorithms for the computation of matchings.
org.jgrapht.alg.spanning	Spanning tree and spanner algorithms.
org.jgrapht.alg.util	Utilities used by JGraphT algorithms.
org.jgrapht.alg.vertexcover	Vertex cover algorithms.
org.jgrapht.graph	Implementations of various graphs.
org.jgrapht.graph.builder	Various builder for graphs.

Uses of UndirectedGraph in org.jgrapht

Methods in org.jgrapht that return UndirectedGraph

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

Methods in org.jgrapht with parameters of type UndirectedGraph

Modifier and Type	Method	Description
static <V,E> boolean	GraphTests.isConnected(UndirectedGraph<V,E> graph)	Test whether an undirected graph is connected.
static <V,E> boolean	GraphTests.isTree(UndirectedGraph<V,E> graph)	Test whether an undirected graph is a tree.

Uses of UndirectedGraph in org.jgrapht.alg

Classes in org.jgrapht.alg that implement UndirectedGraph

Modifier and Type	Class	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.

Fields in org.jgrapht.alg declared as UndirectedGraph

Modifier and Type	Field	Description
private UndirectedGraph<V,E>	CliqueMinimalSeparatorDecomposition.chordalGraph	Minimal triangulation of graph
private UndirectedGraph<V,E>	BlockCutpointGraph.graph
private UndirectedGraph<V,E>	CliqueMinimalSeparatorDecomposition.graph	Source graph to operate on
private UndirectedGraph<V,E>	EdmondsBlossomShrinking.graph	Deprecated.
private UndirectedGraph<V,E>	GreedyMultiplicativeSpanner.graph	Deprecated.
private UndirectedGraph<V,E>	HopcroftKarpBipartiteMatching.graph	Deprecated.
protected UndirectedGraph<V,E>	GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm.spanner

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

Modifier and Type	Field	Description
private java.util.Map<V,java.util.Set<UndirectedGraph<V,E>>>	BlockCutpointGraph.vertex2biconnectedSubgraphs
private java.util.Map<V,UndirectedGraph<V,E>>	BlockCutpointGraph.vertex2block

Methods in org.jgrapht.alg that return UndirectedGraph

Modifier and Type	Method	Description
private static <V,E> UndirectedGraph<V,E>	CliqueMinimalSeparatorDecomposition.copyAsSimpleGraph(UndirectedGraph<V,E> graph)	Create a copy of a graph for internal use.
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.
UndirectedGraph<V,E>	CliqueMinimalSeparatorDecomposition.getGraph()	Get the original graph.
UndirectedGraph<V,E>	CliqueMinimalSeparatorDecomposition.getMinimalTriangulation()	Get the minimal triangulation of the graph.

Methods in org.jgrapht.alg that return types with arguments of type UndirectedGraph

Modifier and Type	Method	Description
private java.util.Set<UndirectedGraph<V,E>>	BlockCutpointGraph.getBiconnectedSubgraphs(V vertex)	Returns the biconnected components containing the vertex.

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

Modifier and Type	Method	Description
private static <V,E> UndirectedGraph<V,E>	CliqueMinimalSeparatorDecomposition.copyAsSimpleGraph(UndirectedGraph<V,E> graph)	Create a copy of a graph for internal use.
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> java.util.Map<java.lang.Integer,java.util.Set<V>>	ChromaticNumber.findGreedyColoredGroups(UndirectedGraph<V,E> g)	Finds a greedy coloring of the graph.
static <V,E> java.util.List<V>	EulerianCircuit.getEulerianCircuitVertices(UndirectedGraph<V,E> g)	Deprecated. This method will return a list of vertices which represents the Eulerian circuit of the graph.
private static <V,E> boolean	CliqueMinimalSeparatorDecomposition.isClique(UndirectedGraph<V,E> graph, java.util.Set<V> vertices)	Check whether the subgraph of graph induced by the given vertices is complete, i.e.
static <V,E> boolean	EulerianCircuit.isEulerian(UndirectedGraph<V,E> graph)	Deprecated. Test whether a graph is Eulerian.

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

Constructor	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.
CliqueMinimalSeparatorDecomposition(UndirectedGraph<V,E> g)	Setup a clique minimal separator decomposition on undirected graph g.
ConnectivityInspector(UndirectedGraph<V,E> g)	Creates a connectivity inspector for the specified undirected graph.
EdmondsBlossomShrinking(UndirectedGraph<V,E> G)	Deprecated. Construct an instance of the Edmonds blossom shrinking algorithm.
GreedyMultiplicativeSpanner(UndirectedGraph<V,E> graph, int k)	Deprecated. Constructs instance to compute a (2k-1)-spanner of a graph.
HopcroftKarpBipartiteMatching(UndirectedGraph<V,E> graph, java.util.Set<V> partition1, java.util.Set<V> partition2)	Deprecated. Create a new instance of the Hopcroft-Karp algorithm for the computation of maximum matchings in bipartite graphs.
StoerWagnerMinimumCut(UndirectedGraph<V,E> graph)	Will compute the minimum cut in graph.

Uses of UndirectedGraph in org.jgrapht.alg.cycle

Fields in org.jgrapht.alg.cycle declared as UndirectedGraph

Modifier and Type	Field	Description
private UndirectedGraph<V,E>	PatonCycleBase.graph

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

Modifier and Type	Method	Description
UndirectedGraph<V,E>	PatonCycleBase.getGraph()	Returns the graph on which the cycle base search algorithm is executed by this object.
UndirectedGraph<V,E>	UndirectedCycleBase.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	Description
void	PatonCycleBase.setGraph(UndirectedGraph<V,E> graph)	Sets the graph on which the cycle base search algorithm is executed by this object.
void	UndirectedCycleBase.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	Description
PatonCycleBase(UndirectedGraph<V,E> graph)	Create a cycle base finder for the specified graph.

Uses of UndirectedGraph in org.jgrapht.alg.interfaces

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

Modifier and Type	Method	Description
MinimumVertexCoverAlgorithm.VertexCover<V>	MinimumVertexCoverAlgorithm.getVertexCover(UndirectedGraph<V,E> graph)	Computes a vertex cover; all vertices are considered to have equal weight.
default MinimumVertexCoverAlgorithm.VertexCover<V>	MinimumWeightedVertexCoverAlgorithm.getVertexCover(UndirectedGraph<V,E> graph)	Computes a vertex cover; all vertices are considered to have equal weight.
MinimumVertexCoverAlgorithm.VertexCover<V>	MinimumWeightedVertexCoverAlgorithm.getVertexCover(UndirectedGraph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)	Computes a vertex cover; the weight of each vertex is provided in the in the vertexWeightMap.

Uses of UndirectedGraph in org.jgrapht.alg.matching

Fields in org.jgrapht.alg.matching declared as UndirectedGraph

Modifier and Type	Field	Description
private UndirectedGraph<V,E>	EdmondsBlossomShrinking.graph
private UndirectedGraph<V,E>	HopcroftKarpBipartiteMatching.graph
private UndirectedGraph<V,E>	MaximumWeightBipartiteMatching.graph

Uses of UndirectedGraph in org.jgrapht.alg.spanning

Fields in org.jgrapht.alg.spanning declared as UndirectedGraph

Modifier and Type	Field	Description
private UndirectedGraph<V,E>	GreedyMultiplicativeSpanner.graph
protected UndirectedGraph<V,E>	GreedyMultiplicativeSpanner.UnweightedSpannerAlgorithm.spanner

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

Constructor	Description
GreedyMultiplicativeSpanner(UndirectedGraph<V,E> graph, int k)	Constructs instance to compute a (2k-1)-spanner of an undirected graph.

Uses of UndirectedGraph in org.jgrapht.alg.util

Fields in org.jgrapht.alg.util declared as UndirectedGraph

Modifier and Type	Field	Description
private UndirectedGraph<V,E>	VertexDegreeComparator.graph	The graph that contains the vertices to be compared.

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

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

Uses of UndirectedGraph in org.jgrapht.alg.vertexcover

Fields in org.jgrapht.alg.vertexcover declared as UndirectedGraph

Modifier and Type	Field	Description
private UndirectedGraph<V,E>	RecursiveExactVCImpl.graph	Input graph

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

Modifier and Type	Method	Description
MinimumVertexCoverAlgorithm.VertexCover<V>	BarYehudaEvenTwoApproxVCImpl.getVertexCover(UndirectedGraph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)
MinimumVertexCoverAlgorithm.VertexCover<V>	ClarksonTwoApproxVCImpl.getVertexCover(UndirectedGraph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)
MinimumVertexCoverAlgorithm.VertexCover<V>	EdgeBasedTwoApproxVCImpl.getVertexCover(UndirectedGraph<V,E> graph)	Finds a 2-approximation for a minimal vertex cover of the specified graph.
MinimumVertexCoverAlgorithm.VertexCover<V>	GreedyVCImpl.getVertexCover(UndirectedGraph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)	Finds a greedy solution to the minimum weighted vertex cover problem.
MinimumVertexCoverAlgorithm.VertexCover<V>	RecursiveExactVCImpl.getVertexCover(UndirectedGraph<V,E> graph)
MinimumVertexCoverAlgorithm.VertexCover<V>	RecursiveExactVCImpl.getVertexCover(UndirectedGraph<V,E> graph, java.util.Map<V,java.lang.Double> vertexWeightMap)

Uses of UndirectedGraph in org.jgrapht.graph

Classes in org.jgrapht.graph that implement UndirectedGraph

Modifier and Type	Class	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>	An undirected version of the read-only union of two graphs.
class	UndirectedMaskSubgraph<V,E>	An undirected graph that is a MaskSubgraph of another graph.
class	UndirectedSubgraph<V,E>	An undirected graph that is a subgraph of another 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.

Fields in org.jgrapht.graph declared as UndirectedGraph

Modifier and Type	Field	Description
private UndirectedGraph<V,E>	MixedGraphUnion.undirectedGraph

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

Constructor	Description
ListenableUndirectedGraph(UndirectedGraph<V,E> base)	Creates a new listenable undirected graph.
MixedGraphUnion(UndirectedGraph<V,E> g1, DirectedGraph<V,E> g2)	Construct a new graph union.
MixedGraphUnion(UndirectedGraph<V,E> g1, DirectedGraph<V,E> g2, WeightCombiner operator)	Construct a new graph union.
UndirectedGraphUnion(UndirectedGraph<V,E> g1, UndirectedGraph<V,E> g2)
UndirectedGraphUnion(UndirectedGraph<V,E> g1, UndirectedGraph<V,E> g2, WeightCombiner operator)
UndirectedMaskSubgraph(UndirectedGraph<V,E> base, java.util.function.Predicate<V> vertexMask, java.util.function.Predicate<E> edgeMask)	Create a new undirected MaskSubgraph of another graph.
UndirectedMaskSubgraph(UndirectedGraph<V,E> base, MaskFunctor<V,E> mask)	Deprecated. in favor of using lambdas
UndirectedSubgraph(UndirectedGraph<V,E> base)	Creates a new undirected induced subgraph with all vertices included.
UndirectedSubgraph(UndirectedGraph<V,E> base, java.util.Set<? extends V> vertexSubset)	Creates a new undirected induced subgraph.
UndirectedSubgraph(UndirectedGraph<V,E> base, java.util.Set<? extends V> vertexSubset, java.util.Set<? extends E> edgeSubset)	Creates a new undirected subgraph.
UnmodifiableUndirectedGraph(UndirectedGraph<V,E> g)	Creates a new unmodifiable undirected graph based on the specified backing graph.

Uses of UndirectedGraph in org.jgrapht.graph.builder

Classes in org.jgrapht.graph.builder with type parameters of type UndirectedGraph

Modifier and Type	Class	Description
class	UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>>	A builder class for Graph.
class	UndirectedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>>	Base class for UndirectedGraphBuilder for extending.
class	UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>>	A builder class for undirected weighted graphs.
class	UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>>	Base class for UndirectedWeightedGraphBuilder for extending.