grph.algo.structural

Class OreTheorem

java.lang.Object

grph.GrphAlgorithm<java.lang.Boolean>

grph.algo.structural.OreTheorem

All Implemented Interfaces:

java.io.Serializable

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

Ore theorem considers the sum of the degrees of any two non-adjacent vertices: if this sum is always at least equal to the total number of vertices in the graph, then the graph is Hamiltonian. http://testard.frederic.pagesperso-orange.fr/mathematiques/coursGraphes/ chapitre02/cours/chapitre02_1.htm

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
OreTheorem()

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

OreTheorem

public OreTheorem()

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>