graph.properties

Class Bipartite<V extends Vertex,E extends Edge<V>>

java.lang.Object

graph.properties.Bipartite<V,E>

Type Parameters:

V - The vertex type

E - The edge type

public class Bipartite<V extends Vertex,E extends Edge<V>>
extends java.lang.Object

A class for checking the bipartite property of a graph Bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V (that is, U and V are each independent sets) such that every edge connects a vertex in U to one in V. Vertex set U and V are often denoted as partite sets.

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
Bipartite(Graph<V,E> graph)

Method Summary

Modifier and Type	Method and Description
boolean	isBipartite() Determines whether an undirected graph is bipartite and finds either a bipartition or an odd-length cycle.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Bipartite

public Bipartite(Graph<V,E> graph)

Method Detail

isBipartite

public boolean isBipartite()

Determines whether an undirected graph is bipartite and finds either a bipartition or an odd-length cycle.

Returns:

true if the graph is bipartite, false otherwise