153.txt

This complete matlab for neural network

发信人: helloboy (hello), 信区: DataMining
标  题: [转载] A new fast shortest path solution
发信站: 南京大学小百合站 (Sun Sep 29 18:56:03 2002), 站内信件

【 以下文字转载自 AI 讨论区 】
【 原文由 helloboy 所发表 】

I have developed a new method to get all the shortest paths between
any two nodes. This method is faster than dijiska method, whose time complexity
 is O(n^3) . My method results in O(n^2*logn) .
I hear an existing method results in O(n^2). But I am not sure.
So I want to research on this
paper to further improve my shortest path algorithm.
But I don't know where to find this paper.
Please help me.       

--
※ 来源:．南京大学小百合站 bbs.nju.edu.cn．[FROM: 202.38.215.213]
--
※ 转载:．南京大学小百合站 bbs.nju.edu.cn．[FROM: 202.38.215.213]