Notice: On April 23, 2014, Statalist moved from an email list to a forum, based at statalist.org.
[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 <[email protected]>
To
[email protected]
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 <[email protected]> :
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
<[email protected]> 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/