grph.algo.structural

Class DiracTheorem

java.lang.Object

grph.GrphAlgorithm<java.lang.Boolean>

grph.algo.structural.DiracTheorem

All Implemented Interfaces:

java.io.Serializable

public class DiracTheorem
extends GrphAlgorithm<java.lang.Boolean>

Dirac's theorem on Hamiltonian cycles, the statement that an n-vertex graph in which each vertex has degree at least n/2 must have a Hamiltonian cycle"; http://testard.frederic.pagesperso-orange.fr/mathematiques/coursGraphes/ chapitre02/cours/chapitre02_1.htm

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
DiracTheorem()

Method Summary

Modifier and Type	Method and Description
java.lang.Boolean	compute(Grph g) Are we sure the graph is hamiltonian?

Methods inherited from class grph.GrphAlgorithm

cacheResultForGraph, getSourceCode

Methods inherited from class java.lang.Object

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

Constructor Detail

DiracTheorem

public DiracTheorem()

Method Detail

compute

public java.lang.Boolean compute(Grph g)

Are we sure the graph is hamiltonian?

Specified by:

compute in class GrphAlgorithm<java.lang.Boolean>