#ifndef _QUOR_GRAPH_H_ #define _QUOR_GRAPH_H_ #include #include #include #include #include "move.h" struct graph_t { size_t num_vertices; // Number of vertices in the graph gsl_spmatrix_uint* t; // Sparse matrix of size n*n in COO format, // t[i][j] > 0 means there is an edge from i to j // t[i][j] == 1 means that j is NORTH of i // t[i][j] == 2 means that j is SOUTH of i // t[i][j] == 3 means that j is WEST of i // t[i][j] == 4 means that j is EAST of i gsl_spmatrix_uint* o; // Sparse matrix of size 2*n, in COO format, // One line per player // o[p][i] == 1 means that the vertex i is owned by p }; #endif // _QUOR_GRAPH_H_