CoxIter  1.2 CoxIter - Computing invariants of hyperbolic Coxeter groups
Graph Class Reference

This class represents one graph. More...

`#include <graph.h>`

## Public Member Functions

Graph (const vector< short unsigned int > &iVertices, vector< string > *ptr_map_vertices_indexToLabel, const vector< bool > &bVerticesLinkable, const unsigned int &iType, const bool &bSpherical, const unsigned int &iDataSupp=0)
Constructeur. More...

bool bIsSubgraphOf (const Graph *grBig) const
Test if a graph (spherical) is a subgraph of another graph (spherical or euclidean) More...

bool bIsSubgraphOf_spherical_spherical (const Graph *grBig) const
Test if a graph (spherical) is a subgraph of another graph (spherical) graph. More...

bool bIsSubgraphOf_spherical_euclidean (const Graph *grBig) const
Test if a graph (spherical) is a subgraph of another graph (euclidean) graph. More...

## Public Attributes

vector< short unsigned int > iVertices
Vertices of the graph. More...

A quels sommets on peut lier le graphe { sommets } \ { sommets du graphes et leurs voisins ) More...

unsigned int iGraphType
Type of the graph: A=0, B=1, ... More...

unsigned int iDataSupp
In the case of G_2^n, the weight. More...

bool bSpherical
True if spherical, false if euclidean. More...

## Static Private Member Functions

static bool bAnSubAm (const vector< short unsigned int > &iSubV, const vector< short unsigned int > &iBigV)

## Private Attributes

vector< string > * ptr_map_vertices_indexToLabel
Pointeur vers la correspondance. More...

bool b_map_vertices_indexToLabelIsEmpty

## Friends

bool operator== (const Graph &g1, const Graph &g2)

bool operator< (const Graph &g1, const Graph &g2)

ostream & operator<< (ostream &, Graph const &)

## Detailed Description

This class represents one graph.

## Constructor & Destructor Documentation

 Graph::Graph ( const vector< short unsigned int > & iVertices, vector< string > * ptr_map_vertices_indexToLabel, const vector< bool > & bVerticesLinkable, const unsigned int & iType, const bool & bSpherical, const unsigned int & iDataSupp = `0` )

Constructeur.

Parameters
 iVertices( const vector& ) Sommets composant le graphe ptr_map_vertices_indexToLabel( vector< string > * ) Pointeur vers la correspondance index –> label des sommets bVerticesLinkable( const vector< bool >& ) Ce à quoi le graphe est liable iType ( const unsigned int & ) Type du graphe: A=0, B=1, ... bSpherical( const bool& ) True si sphérique, false si euclidien iDataSupp( const unsigned int & ) Eventuelle information supplémentaire, par exemple poids pour le G2

## Member Function Documentation

 bool Graph::bAnSubAm ( const vector< short unsigned int > & iSubV, const vector< short unsigned int > & iBigV )
staticprivate
 Graph::bIsSubgraphOf ( const Graph * grBig ) const

Test if a graph (spherical) is a subgraph of another graph (spherical or euclidean)

Parameters
 grBig( Graph* ) Bigger graph
Returns
True if the *this is a subgraph of the graph given in parameter, false otherwise
 Graph::bIsSubgraphOf_spherical_euclidean ( const Graph * grBig ) const

Test if a graph (spherical) is a subgraph of another graph (euclidean) graph.

Parameters
 grBig( Graph* ) Bigger graph
Returns
True if the *this is a subgraph of the graph given in parameter, false otherwise
 Graph::bIsSubgraphOf_spherical_spherical ( const Graph * grBig ) const

Test if a graph (spherical) is a subgraph of another graph (spherical) graph.

Parameters
 grBig( Graph* ) Bigger graph
Returns
True if the *this is a subgraph of the graph given in parameter, false otherwise

## Friends And Related Function Documentation

 bool operator< ( const Graph & g1, const Graph & g2 )
friend
 ostream& operator<< ( ostream & , Graph const & )
friend
 bool operator== ( const Graph & g1, const Graph & g2 )
friend

## Member Data Documentation

 bool Graph::b_map_vertices_indexToLabelIsEmpty
private
 bool Graph::bSpherical

True if spherical, false if euclidean.

A quels sommets on peut lier le graphe { sommets } \ { sommets du graphes et leurs voisins )

 unsigned int Graph::iDataSupp

In the case of G_2^n, the weight.

 unsigned int Graph::iGraphType

Type of the graph: A=0, B=1, ...

 vector< short unsigned int > Graph::iVertices

Vertices of the graph.

 vector< string >* Graph::ptr_map_vertices_indexToLabel
private

Pointeur vers la correspondance.

The documentation for this class was generated from the following files: