void create_adj_mat(){
igraph_spmatrix_init(&adjMat, nVertices, nVertices);
igraph_get_adjacency_sparse(&g, &adjMat, 0);
int i;
for(i=0;i<nVertices;++i){
igraph_spmatrix_add_e(&adjMat, i, i,1);
}
//igraph_spmatrix_print(&adjMat);
}
int igraph_get_adjacency_sparse(const igraph_t *graph, igraph_spmatrix_t *res,
igraph_get_adjacency_t type) {
igraph_eit_t edgeit;
long int no_of_nodes=igraph_vcount(graph);
igraph_bool_t directed=igraph_is_directed(graph);
int retval=0;
long int from, to;
igraph_integer_t ffrom, fto;
igraph_spmatrix_null(res);
IGRAPH_CHECK(igraph_spmatrix_resize(res, no_of_nodes, no_of_nodes));
IGRAPH_CHECK(igraph_eit_create(graph, igraph_ess_all(0), &edgeit));
IGRAPH_FINALLY(igraph_eit_destroy, &edgeit);
if (directed) {
while (!IGRAPH_EIT_END(edgeit)) {
igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto);
from=ffrom;
to=fto;
igraph_spmatrix_add_e(res, from, to, 1);
IGRAPH_EIT_NEXT(edgeit);
}
} else if (type==IGRAPH_GET_ADJACENCY_UPPER) {
while (!IGRAPH_EIT_END(edgeit)) {
igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto);
from=ffrom;
to=fto;
if (to < from) {
igraph_spmatrix_add_e(res, to, from, 1);
} else {
igraph_spmatrix_add_e(res, from, to, 1);
}
IGRAPH_EIT_NEXT(edgeit);
}
} else if (type==IGRAPH_GET_ADJACENCY_LOWER) {
while (!IGRAPH_EIT_END(edgeit)) {
igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto);
from=ffrom;
to=fto;
if (to > from) {
igraph_spmatrix_add_e(res, to, from, 1);
} else {
igraph_spmatrix_add_e(res, from, to, 1);
}
IGRAPH_EIT_NEXT(edgeit);
}
} else if (type==IGRAPH_GET_ADJACENCY_BOTH) {
while (!IGRAPH_EIT_END(edgeit)) {
igraph_edge(graph, IGRAPH_EIT_GET(edgeit), &ffrom, &fto);
from=ffrom;
to=fto;
igraph_spmatrix_add_e(res, from, to, 1);
if (from != to) {
igraph_spmatrix_add_e(res, to, from, 1);
}
IGRAPH_EIT_NEXT(edgeit);
}
} else {
IGRAPH_ERROR("Invalid type argument", IGRAPH_EINVAL);
}
igraph_eit_destroy(&edgeit);
IGRAPH_FINALLY_CLEAN(1);
return retval;
}