Bookmark and Share

Notice: On March 31, it was announced that Statalist is moving from an email list to a forum. The old list will shut down on April 23, and its replacement, statalist.org is already up and running.


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

Re: st: computing distances and amount of shortest paths between points in adjacency matrix


From   Austin Nichols <austinnichols@gmail.com>
To   statalist@hsphsun2.harvard.edu
Subject   Re: st: computing distances and amount of shortest paths between points in adjacency matrix
Date   Thu, 20 May 2010 16:42:35 -0400

Achim Edelmann <achim.edelmann@googlemail.com> :
You can translate
http://www.math.uic.edu/~leon/cs-mcs401-s08/handouts/all-pairs.pdf
to Mata.  Or give an example, and ask for more specific help.

What is "amount of shortest paths" supposed to mean?

On Thu, May 20, 2010 at 2:32 PM, Achim Edelmann
<achim.edelmann@googlemail.com> wrote:
> Hi,
>
> I am searching for an algorithm to compute the distance matrix and the
> amount of shortest paths between points in a given adjacency matrix. Would
> be great if one could point me in the right direction.
>
> Thanks!
>
>  Achim

*
*   For searches and help try:
*   http://www.stata.com/help.cgi?search
*   http://www.stata.com/support/statalist/faq
*   http://www.ats.ucla.edu/stat/stata/


© Copyright 1996–2014 StataCorp LP   |   Terms of use   |   Privacy   |   Contact us   |   Site index