I've not yet had the time to think through the posts in this thread, but http://rosettacode.org/mw/index.php?title=Resistor_mesh#J
might be able to use some cleanup, if we have better ways of expressing this issue. Thanks, -- Raul On Sun, Feb 24, 2013 at 7:21 AM, alessandro codenotti <[email protected]> wrote: > > I had this network problem to solve and i wrote the code to do it, everything > was fine until i noticed i wasn't able to compute the adjacency matric to > work on! > > the network is a square network where every node is connected to is > neighbours, for the 3x3 case it looks like this: > > A----B----C > | | | > D----E----F > | | | > G----H----I > > where A,B,C...,I are the 9 nodes and the corresponding adjacency matrix can > be easily obtained by hand, however i have to work on different networks of > different sizes, but they are all squares and all connected like that. > My question then is more a maths question than a programming one (well, is > there any J programmer that doesn't love maths?), if i need the adjacency > matrich of such networks, is there an easy way to find it knowing the > propertiese of the network given above? and how can i do it in J? > > thank in advice for the help! > > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
