| | |
| | | return vlist; |
| | | } |
| | | |
| | | |
| | | ts_bool vertex_list_add_vtx(ts_vertex_list *vlist, ts_vertex *vtx){ |
| | | |
| | | #ifdef DEBUG |
| | | if(vtx==NULL || vlist==NULL) return TS_FAIL; |
| | | #endif |
| | | if(vlist->list_size < vlist->n+1){ |
| | | vlist->vtx=(ts_vertex **)realloc(vlist->vtx, (vlist->list_size+TS_VLIST_CHUNK)*sizeof(ts_vertex*)); |
| | | if(vlist->vtx==NULL){ |
| | | fatal("Error in vertex_list_add. Could not reallocate memory space.",9999); |
| | | } |
| | | vlist->list_size+=TS_VLIST_CHUNK; |
| | | } |
| | | vlist->vtx[n]=vtx; |
| | | vlist->n++; |
| | | return TS_SUCCESS; |
| | | } |
| | | |
| | | |
| | | /* Idea is to delete vertex by removing it from list. The emply place is then filled in by the last |
| | | vertex in the list. List can then be resized by one -- unless resize is required when max list size - |
| | | real list size > predefined value */ |
| | | ts_bool vertex_list_remove_vtx(ts_vertex_list *vlist, ts_vertex *vtx){ |
| | | #ifdef DEBUG |
| | | if(vtx==NULL || vlist==NULL) return TS_FAIL; |
| | | #endif |
| | | for(i=0; i<vlist->n;i++){ |
| | | if(vlist->vtx[i]==vtx){ |
| | | vlist->vtx[i]=vlist->vtx[n-1]; |
| | | vlist->n--; |
| | | if(vlist->list_size-vlist->n > TS_VLIST_CHUNK){ |
| | | vlist->vtx=(ts_vertex **)realloc(vlist->vtx, (vlist->list_size-TS_VLIST_CHUNK)*sizeof(ts_vertex*)); |
| | | if(vlist->vtx==NULL){ |
| | | fatal("Error in vertex_list_add. Could not reallocate memory space.",9999); |
| | | } |
| | | vlist->list_size-=TS_VLIST_CHUNK; |
| | | } |
| | | return TS_SUCCESS; |
| | | } |
| | | } |
| | | return TS_FAIL; |
| | | } |
| | | |
| | | |
| | | ts_bool vtx_add_neighbour(ts_vertex *vtx, ts_vertex *nvtx){ |
| | | ts_uint i; |
| | | /* no neighbour can be null! */ |
| | | if(vtx==NULL || nvtx==NULL) return TS_FAIL; |
| | | |
| | | /*if it is already a neighbour don't add it to the list */ |
| | | for(i=0; i<vtx->neigh_no;i++){ |
| | | if(vtx->neigh[i]==nvtx) return TS_FAIL; |
| | | for(i=0; i<vtx->neigh->n;i++){ |
| | | if(vtx->neigh->vtx[i]==nvtx) return TS_FAIL; |
| | | } |
| | | ts_uint nn=++vtx->neigh_no; |
| | | ts_uint nn=++vtx->neigh->n; |
| | | vtx->neigh=(ts_vertex **)realloc(vtx->neigh, nn*sizeof(ts_vertex *)); |
| | | vtx->neigh[nn-1]=nvtx; |
| | | /* This was a bug in creating DIPYRAMID (the neighbours were not in right |
| | | * order). |
| | | */ |
| | | /* pa se sosedu dodamo vertex */ |
| | | /*if it is already a neighbour don't add it to the list */ |
| | | /* |
| | | for(i=0; i<nvtx->data->neigh_no;i++){ |
| | | if(nvtx->data->neigh[i]==vtx) return TS_FAIL; |
| | | } |
| | | nn=++nvtx->data->neigh_no; |
| | | nvtx->data->neigh=(ts_vertex **)realloc(nvtx->data->neigh, nn*sizeof(ts_vertex *)); |
| | | nvtx->data->neigh[nn-1]=vtx; |
| | | */ |
| | | |
| | | return TS_SUCCESS; |
| | | } |
| | |
| | | /* remove it from the list while shifting remaining neighbours up */ |
| | | ts_uint i,j=0; |
| | | for(i=0;i<vtx->neigh_no;i++){ |
| | | // fprintf(stderr,"neigh_addr=%ld\n", (long)vtx->neigh[i]); |
| | | if(vtx->neigh[i]!=nvtx){ |
| | | vtx->neigh[j]=vtx->neigh[i]; |
| | | j++; |
| | | } |
| | | } |
| | | if(j==0) { |
| | | fatal("vtx_remove_neighbour: Error, vertices are not neighbours", 100); |
| | | } |
| | | // fprintf(stderr,"remove_neighbour: vtx1_addr=%ld, vtx2_addr=%ld\n",(long)vtx,(long)nvtx); |
| | | /* resize memory. potentionally time consuming */ |
| | | vtx->neigh_no--; |
| | | vtx->neigh=(ts_vertex **)realloc(vtx->neigh,vtx->neigh_no*sizeof(ts_vertex *)); |
| | | if(vtx->neigh == NULL && vtx->neigh_no!=0) |
| | | fatal("Reallocation of memory failed during removal of vertex neighbour in vtx_remove_neighbour",100); |
| | | |
| | | fatal("(1) Reallocation of memory failed during removal of vertex neighbour in vtx_remove_neighbour",100); |
| | | //fprintf(stderr,"first alloc"); |
| | | /* repeat for the neighbour */ |
| | | /* find a neighbour */ |
| | | /* remove it from the list while shifting remaining neighbours up */ |
| | | j=0; |
| | | for(i=0;i<nvtx->neigh_no;i++){ |
| | | if(nvtx->neigh[i]!=vtx){ |
| | | nvtx->neigh[j]=nvtx->neigh[i]; |
| | |
| | | } |
| | | } |
| | | /* resize memory. potentionally time consuming. */ |
| | | // fprintf(stderr,"Neigbours=%d\n",nvtx->neigh_no); |
| | | nvtx->neigh_no--; |
| | | nvtx->neigh=(ts_vertex **)realloc(nvtx->neigh,nvtx->neigh_no*sizeof(ts_vertex *)); |
| | | nvtx->neigh=(ts_vertex **)realloc(nvtx->neigh,nvtx->neigh_no*sizeof(ts_vertex *)); |
| | | // fprintf(stderr,"Neigbours=%d\n",nvtx->neigh_no); |
| | | if(nvtx->neigh == NULL && nvtx->neigh_no!=0) |
| | | fatal("Reallocation of memory failed during removal of vertex neighbour in vtx_remove_neighbour",100); |
| | | fatal("(2) Reallocation of memory failed during removal of vertex neighbour in vtx_remove_neighbour",100); |
| | | |
| | | return TS_SUCCESS; |
| | | } |
| | |
| | | ts_bool vtx_add_cneighbour(ts_bond_list *blist, ts_vertex *vtx1, ts_vertex *vtx2){ |
| | | ts_bool retval; |
| | | retval=vtx_add_neighbour(vtx1,vtx2); |
| | | // retval=vtx_add_neighbour(vtx2,vtx1); |
| | | if(retval==TS_SUCCESS) |
| | | retval=vtx_add_bond(blist,vtx1,vtx2); |
| | | return retval; |