Bellman Ford algorithm for finding the shortest path between nodes is an algorithm used.
primarily in the gray box identifies nodes are between our EDGE. Then we set the starting node (for one example)
resulting path will be drawn on lef
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002679s ]
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.090552s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000988s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001112s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000974s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003070s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000857s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.005453s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015898s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001068s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 283575 [ RunTime:0.021030s ]
