[R] Re: About ability of "allShortestPaths" function in e1071 package

Friedrich.Leisch@ci.tuwien.ac.at Friedrich.Leisch at ci.tuwien.ac.at
Thu Mar 27 19:12:43 CET 2003

>>>>> On Thu, 27 Mar 2003 23:49:04 +0900,
>>>>> Hisaji Ono (HO) wrote:

  > Hello.
  >  R's e1071 package has "allShortestPaths" function using Floyd's algorithm.

  >  It is very useful for road network analysis. I'll try to analyze facility
  > allocation programs using this.

  >  I'd like to know how much nodes this function can deal with?

  >  And for larger nodes(for example million nodes), allShortestPaths employs
  > graph partition algorithm?

no, the current implementation uses matrices to represent the graph,
hence it can only handle several thousand nodes depending on thje
amount of memory your computer has. millions of nodes is currently


                        Friedrich Leisch 
Institut für Statistik                     Tel: (+43 1) 58801 10715
Technische Universität Wien                Fax: (+43 1) 58801 10798
Wiedner Hauptstraße 8-10/1071      Friedrich.Leisch at ci.tuwien.ac.at
A-1040 Wien, Austria             http://www.ci.tuwien.ac.at/~leisch

More information about the R-help mailing list