>>>>> 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
impossible.
best,
--
-------------------------------------------------------------------
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 [EMAIL PROTECTED]
A-1040 Wien, Austria http://www.ci.tuwien.ac.at/~leisch
-------------------------------------------------------------------
______________________________________________
[EMAIL PROTECTED] mailing list
https://www.stat.math.ethz.ch/mailman/listinfo/r-help
