69 void addGraph(
const vector<short unsigned int> &vertices,
70 const vector<bool> &linkableVertices,
const unsigned int &type,
71 bool isSpherical,
const unsigned int &vertexSupp1 = 0,
72 const unsigned int &vertexSupp2 = 0,
73 const unsigned int &dataSupp = 0);
92 Graph *
next(
size_t &verticesCount,
size_t &graphIndex);
This class represents one graph.
Definition graph.h:42
Liste des graphes.
Definition graphs.list.h:40
Graph * next(size_t &verticesCount, size_t &graphIndex)
Retourne un pointeur sur l'élément suivant de la liste.
Definition graphs.list.cpp:78
size_t totalGraphsCount
Total number of graphs.
Definition graphs.list.h:99
vector< size_t > graphsCount
Number of graphs (by number of vertices)
Definition graphs.list.h:97
Graph * begin()
Retourne un pointeur sur le premier graphe de la liste.
Definition graphs.list.cpp:66
friend ostream & operator<<(ostream &, GraphsList const &)
Definition graphs.list.cpp:94
vector< GraphsListN > graphs
List of list of graphs (by number of vertices)
Definition graphs.list.h:96
size_t maxVertices
Maximum number of vertices in the graphs.
Definition graphs.list.h:100
void addGraph(const vector< short unsigned int > &vertices, const vector< bool > &linkableVertices, const unsigned int &type, bool isSpherical, const unsigned int &vertexSupp1=0, const unsigned int &vertexSupp2=0, const unsigned int &dataSupp=0)
Definition graphs.list.cpp:35