This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your program. It s a port from Patrick Lesters example in BlitzBasic to VB.Net. It uses a Binary Heap class I made to sort the score values.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002419s ]
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.105381s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001184s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001170s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001194s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003082s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000880s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003808s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016656s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001162s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 363542 [ RunTime:0.024898s ]
