Tp de complexite algorithmique sur les graphes
Le but de ce tp est de proposer et programmer des algorithmes permettant de répondre à quatre problèmes de la théorie de la complexité algorithmique:
* Clique
* Coloration
* SAT
* CSP
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002063s ]
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.084366s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002407s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001860s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002803s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003562s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001963s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003167s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014007s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002304s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 280779 [ RunTime:0.001059s ]
