function [r_path, r_cost] = dijkstra(pathS, pathE, transmat)
The Dijkstra s algorithm, Implemented by Yi Wang, 2005
This version support detecting _cyclic-paths_
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001337s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.089824s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001229s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001863s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001235s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003554s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001044s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003185s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014703s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001352s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 482782 [ RunTime:0.001245s ]
