TOJ 3365 ZOJ 3232 It's not Floyd Algorithm / 强连通分量
摘要:
It's not Floyd Algorithm 时间限制(普通/Java):1000MS/3000MS 运行内存限制:65536KByte 描述When a directed graph is given, we can solve its transitive closure easily using the well-known Floyd algorithm.But if you're given a transitive closure, can you give a corresponding directed graph with minimal edges? 输 阅读全文
posted @ 2013-11-14 20:10 新一 阅读(261) 评论(0) 推荐(0)