"H " <mesta2000@hotmail.com> wrote in message <hi7bel$dqn$1@fred.mathworks.com>...
> Ok, I managed to do build the adjacency matrix of the network that I was trying to make. I used a sparse-matrix and with the nodes connected to every neighbor node in sideways and forward includin diagonal nodes, the whole 100x200x16 vertex network took only about 56 Megabytes of memory.
>
> If anyone is interested, I can post my rather inelegant solution. In short I produced column of the network as a nxn matrix and copied it the needed number of times...
indeed, it would be great to be able to have a look at the code...
us
> Ok, I managed to do build the adjacency matrix of the network that I was trying to make. I used a sparse-matrix and with the nodes connected to every neighbor node in sideways and forward includin diagonal nodes, the whole 100x200x16 vertex network took only about 56 Megabytes of memory.
>
> If anyone is interested, I can post my rather inelegant solution. In short I produced column of the network as a nxn matrix and copied it the needed number of times...
indeed, it would be great to be able to have a look at the code...
us
