23 #ifndef GRAPHS_LIST_N_H 24 #define GRAPHS_LIST_N_H 50 GraphsListN(
unsigned int iVerticesCount, vector< string > *ptr_map_vertices_indexToLabel );
62 void addGraph( vector< short unsigned int > iVertices,
const vector< bool > &bVerticesLinkable,
const unsigned &iType,
bool bSpherical,
const short unsigned int &iVertexSupp1 = 0,
const short unsigned int &iVertexSupp2 = 0,
const unsigned int &iDataSupp = 0 );
89 Graph* next(
const size_t &iGraphIndex );
96 unsigned int get_iVerticesCount( )
const;
103 vector< Graph > get_graphs( )
const;
109 #endif // GRAPHS_LIST_N_H Liste des graphes d'une taille donnée.
Definition: graphs.list.n.h:41
vector< string > * ptr_map_vertices_indexToLabel
Pointeur vers la correspondance.
Definition: graphs.list.n.h:47
This class represents one graph.
Definition: graph.h:42
vector< Graph > graphs
Liste des graphes trouvés.
Definition: graphs.list.n.h:44
unsigned int iVerticesCount
Nombre de sommets des graphes de la liste.
Definition: graphs.list.n.h:45
ostream & operator<<(ostream &o, const CoxIter &g)
Definition: coxiter.cpp:1313