[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Euclidean distance between two adj matrices

From: Gábor Csárdi
Subject: Re: [igraph] Euclidean distance between two adj matrices
Date: Thu, 7 Jan 2010 19:25:45 +0100

Hi Anupam,

you mean with 'igraph' objects? I don't know of such a function. Maybe
you could play with the operators, create the union of the graphs to
get all edges, the intersection to get the common ones. This should be
enough to calculate the Euclidean distance. (Btw. what do you exactly
mean by 'Euclidean distance'?)

If you have matrices, then it is easy of course:
sqrt(sum((M1 - M2) ^ 2 ))

But this is slow if you have large, sparse matrices.


On Wed, Dec 30, 2009 at 7:04 AM, anupam sinha <address@hidden> wrote:
> Dear all,
>                Is there any igraph function in R to measure the euclidean
> distance between two adjacency matrices ? Thanks in advance for any
> suggestions.
> Regards,
> Anupam
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     UNIL DGM

reply via email to

[Prev in Thread] Current Thread [Next in Thread]