This project tries to provide an efficient method to check whether a graph can be totally colored with n numbers.
The code is concurrent in nature and is implemented in C with pthreads.
文 件 列 表
dall dall_debug.c dall_color.h in.txt dall_color.c dall_debug.h dall_check.h dall_utils.c dall_pool.h docs dall_utils.h dall_pool.c .kdbgrc.serial dall_check.c dall_serial.c dall_par_1.c serial Doxyfile dall_parallel.c Makefile
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001204s ]
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.088785s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001267s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002772s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001252s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003626s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001065s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003353s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016055s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001396s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 270576 [ RunTime:0.001415s ]
