This class tests the arithmeticity of a graph which has no dotted edge and which is non-cocompact. It uses Vinberg's criteria.
More...
#include <arithmeticity.h>
This class tests the arithmeticity of a graph which has no dotted edge and which is non-cocompact. It uses Vinberg's criteria.
◆ Arithmeticity()
| Arithmeticity::Arithmeticity |
( |
| ) |
|
◆ ~Arithmeticity()
| Arithmeticity::~Arithmeticity |
( |
| ) |
|
◆ collapseQueues()
| Arithmeticity::collapseQueues |
( |
| ) |
|
|
private |
Try to collapse queues of the graph.
- Returns
- Number of vertices removed
◆ findCycles()
| Arithmeticity::findCycles |
( |
const unsigned int & |
root, |
|
|
const unsigned int & |
from |
|
) |
| |
|
private |
Look for cycles.
Update the vector path to find cycles
- Parameters
-
| root(unsigned | int&) Starting vertex |
| from(unsigned | int&) Previoud vertex (if recursive call); root otherwise |
◆ get_allCycles()
| Arithmeticity::get_allCycles |
( |
| ) |
|
Return the list of cycles.
- Returns
- List (vector<string>)
◆ get_error()
| Arithmeticity::get_error |
( |
| ) |
|
Return the error code.
- Returns
- Error code (string)
◆ test()
| Arithmeticity::test |
( |
CoxIter & |
ci, |
|
|
const bool & |
listCycles_ |
|
) |
| |
Test the arithmeticity of a graph.
- Parameters
-
| ci(CoxIter&) | The graph |
| listCycles_(const | bool&) If true, will list the cycles to be manually tested |
- Returns
- True if success, false otherwise. Then, use ci.get_isArithmetic()
◆ testCycle()
| Arithmeticity::testCycle |
( |
| ) |
|
|
private |
Test the cycle in path.
This function is called by findCycles. Eventually, set notArithmetic to true
◆ testCycles()
| Arithmeticity::testCycles |
( |
| ) |
|
|
private |
◆ allCycles
| vector<string> Arithmeticity::allCycles |
|
private |
◆ ci
◆ coxeterMatrix
| vector<vector<unsigned int> > Arithmeticity::coxeterMatrix |
|
private |
Coxeter matrix of the group.
◆ error
| string Arithmeticity::error |
|
private |
If an error occured, small text.
◆ listCycles
| bool Arithmeticity::listCycles |
|
private |
If true, will list the cycles to be manually tested.
◆ notArithmetic
| bool Arithmeticity::notArithmetic |
|
private |
True if not arithmetic (i.e. we have to quit the algorithm)
◆ path
| vector<unsigned int> Arithmeticity::path |
|
private |
◆ referencesToLabels
| vector<unsigned int> Arithmeticity::referencesToLabels |
|
private |
Correspondence for the new indices to the old ones
◆ verticesCount
| unsigned int Arithmeticity::verticesCount |
|
private |
Number of generators of the group.
◆ visitedEdges
| vector<vector<bool> > Arithmeticity::visitedEdges |
|
private |
◆ visitedVertices
| vector<bool> Arithmeticity::visitedVertices |
|
private |
The documentation for this class was generated from the following files:
