search for: allshortestpaths

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...

Hi All, I am using the allShortestPath function based on Floyd's algorithm in e1071 package. It runs great when I have less than 5000 nodes. But when I tried to work on more than 5000 nodes, I ran into memory problem. The problem I really want to solve has 10000-15000 nodes. Does anybody know how to deal with this problem? Are there any other packages in R that can handle this problem?

Dear all, I have an ontology which I would like to load in R to then compute the minimum distance between elements. Since this ontology is not only DAG, the problem is non trivial and therefore decided to use R with the powerful e1071 library (allShortestPaths) to do that. That method requires to provide a distance matrix between the various objects. My ontology contains 32768 objects and therefore I have to load a matrix of 32768x32768. Values in the matrix are set to 1 for those pair of terms that have a link (semantic or hyper/hypo-nimic). I am t...

G'day, I have a matrix 20000 x 500 populated with all the distances between a list of airports and a list of towers. What I'm having trouble doing is finding the closest airport to each tower, Any help would be greatly appreciated. Regards, Michael Williams [[alternative HTML version deleted]]