Search:

Hi

I'm looking for a "shortest path algorithm" in a graph , but with a maximum number of edges limit . So the path has to contain at most N edges .

10x

Happy Holiday

it has to be a cube with tha n*n*n dimensions with n*n*n cells . i tested it with n = 64 and 5 generations , and even with one generation it doesn't stop from running . with n = 10 it's ok

...

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...

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);