MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi
Learn moreOpportunities for recent engineering grads.
Apply TodayMATLAB Central > MATLAB Newsreader > Forming an adjacency matrix 

I'm trying to form an adjacency matrix of a threedimensional evenly spaced network(graph) where one can move to every neighboring node except the ones directly above, beneath and behind the node in question. I.e. movement in forward,sideways and diagonally up and down is accepted. My graph would be quite large (about 100,000 nodes representing a space of 100x100x10) so what I really need some kind of algorithm to build the adjacency matrix. Is there any ready solutions for this problem? 
"H " <mesta2000@hotmail.com> wrote in message <hhsomp$1nj$1@fred.mathworks.com>... 

"Steven Lord" <slord@mathworks.com> wrote in message <hhst9e$mkk$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 sparsematrix 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. 
"H " <mesta2000@hotmail.com> wrote in message <hi7bel$dqn$1@fred.mathworks.com>... 
Subject: Forming an adjacency matrix From: Derek O'Connor Date: 8 Jan, 2010 15:15:04 Message: 7 of 9 
"H " <mesta2000@hotmail.com> wrote in message <hhsomp$1nj$1@fred.mathworks.com>... 
I started by just writing the adjacency matrix for a smaller (4x4 nodes network). In order to keep track of the geometry, I numbered my nodes as: 
I made typo explaining the middle layers. No there's only edges to lower and the same level... There should be a third set of B C of course. 
A tag is like a keyword or category label associated with each thread. Tags make it easier for you to find threads of interest.
Anyone can tag a thread. Tags are public and visible to everyone.