68         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 );
    76         bool bIsSubgraphOf( 
const Graph* grBig ) 
const;
    84         bool bIsSubgraphOf_spherical_spherical( 
const Graph* grBig ) 
const;
    92         bool bIsSubgraphOf_spherical_euclidean( 
const Graph* grBig ) 
const;
    98         static bool bAnSubAm( 
const vector<short unsigned int>& iSubV, 
const vector<short unsigned int>& iBigV );
   106     bool operator() ( 
const Graph* g1, 
const Graph* g2 )
 const  { 
return ( *g1 < *g2 );  }
 bool operator<(const Graph &g1, const Graph &g2)
Definition: graph.cpp:923
 
unsigned int iGraphType
Type of the graph: A=0, B=1, ... 
Definition: graph.h:48
 
This class represents one graph. 
Definition: graph.h:42
 
bool operator==(const Graph &g1, const Graph &g2)
Definition: graph.cpp:918
 
bool b_map_vertices_indexToLabelIsEmpty
Definition: graph.h:56
 
vector< bool > bVerticesLinkable
A quels sommets on peut lier le graphe { sommets } \ { sommets du graphes et leurs voisins ) ...
Definition: graph.h:46
 
unsigned int iDataSupp
In the case of G_2^n, the weight. 
Definition: graph.h:50
 
bool bSpherical
True if spherical, false if euclidean. 
Definition: graph.h:52
 
ostream & operator<<(ostream &o, const CoxIter &g)
Definition: coxiter.cpp:1313
 
vector< string > * ptr_map_vertices_indexToLabel
Pointeur vers la correspondance. 
Definition: graph.h:55
 
vector< short unsigned int > iVertices
Vertices of the graph. 
Definition: graph.h:45