Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2009

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: A Question about adjacency matrix

  • To: mathgroup at smc.vnet.net
  • Subject: [mg104995] Re: A Question about adjacency matrix
  • From: "Sjoerd C. de Vries" <sjoerd.c.devries at gmail.com>
  • Date: Tue, 17 Nov 2009 05:14:05 -0500 (EST)
  • References: <hdon7t$9g1$1@smc.vnet.net>

An adjacency matrix describes relationship between nodes (connection
or no connection). There is often,  but not necessarily a weight
involved. For nodes that are 3D coordinates one could use one of
several distance functions Mathematica has built-in, such as
EuclideanDistance, as  weight. But you can think of many others that
do not involve distance in 3D at all. Any matrix element m[[i,j]]
describes the connection of node i with node j. How you fill it in is
up to you.

Cheers -- Sjoerd

On Nov 15, 1:04 pm, Marwa Abd El-Wahaab <m.a.elwah... at gmail.com>
wrote:
> Dear Sir
>
> I have a question about the adjacency matrix
>
> My question:
>
> How to get adjacency matrix for a graph composed of points in {x,y,z} ?
>
> Thanks in advance
>
> Marwa Ali



  • Prev by Date: Changing variables within a differential equation
  • Next by Date: Sound Functions Crash Kernel
  • Previous by thread: A Question about adjacency matrix
  • Next by thread: graphic