| Class | Description |
|---|---|
| ChordalityTestAlgorithm |
Computes if the graph is chordal
|
| CompletenessAlgorithm | |
| ConnectednessAlgorithm | |
| DiracTheorem |
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
|
| MultigraphnessAlgorithm | |
| MultigraphnessResult | |
| OreTheorem |
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.
|
| ReflexivityAlgorithm | |
| RegularityAlgorithm | |
| SimplenessAlgorithm | |
| TreenessAlgorithm |