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]
st: RE: computing distances and amount of shortest paths between points in adjacency matrix
From
"Martin Weiss" <[email protected]>
To
<[email protected]>
Subject
st: RE: computing distances and amount of shortest paths between points in adjacency matrix
Date
Thu, 20 May 2010 20:37:00 +0200
<>
Have you had a look at the recent thread at
http://www.stata.com/statalist/archive/2010-05/msg00333.html ?
HTH
Martin
-----Original Message-----
From: [email protected]
[mailto:[email protected]] On Behalf Of Achim Edelmann
Sent: Donnerstag, 20. Mai 2010 20:33
To: [email protected]
Subject: st: computing distances and amount of shortest paths between points
in adjacency matrix
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
--------------
Faculty of Social and Political Science
University of Cambridge
Free School Lane
Cambridge CB2 3RQ
Telephone: 07726431071
Email: [email protected]
*
* 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/
*
* 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/