摘要:
floyd后遍历下就好代码Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/--#include<iostream>#include<cstring>#include<cstdio>#include<climits&... 阅读全文
摘要:
SPFA找负环,当一个点入队的次数>=n时就证明出现了负环。代码Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/--#include<iostream>#include<cstdio>#include<cstring&g... 阅读全文