No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
 | Hi I'm looking for a "shortest path algorithm" , but with a maximum number of edges limit . So the path has to contain at most N edges . i've found shortest path algorithms but not with a number of edges limit , and i've tried to modify A* , … |
| | I had to implement Game of Life in a 3D matrix (int a[ ][ ][ ]) , but the complexity of my implementation is O(n^6) (6 imbricated for) and it runs very slow . Can anyone help me with an optimized version of Game of life , even with a …  |
| | I will give a simple example inspired from my problem : void change(int *x, int *y){x=y;} int main(){ int *xx,*yy; yy = (int*)malloc(sizeof(int)); change(xx,yy); if(xx == NULL)printf("is null\n"); else printf("---- %d ----\n",*xx); .................................................. ......... xx doesn't point to the value of yy (*yy) , the program prints "is null" . …  |