2019 年 5月 4 日随笔档案 - 村雨sup

2019年5月4日

摘要： 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) The "Hamilton cycle problem" is to find a simple cycle that 阅读全文

posted @ 2019-05-04 16:00 村雨sup 阅读(142) 评论(0) 推荐(0)

PAT 1126 Eulerian Path

摘要： 1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) In graph theory, an Eulerian path is a path in a graph which visits ever 阅读全文

posted @ 2019-05-04 13:32 村雨sup 阅读(90) 评论(0) 推荐(0)

PAT 1142 Maximal Clique

摘要： 1142 Maximal Clique (25 分) 1142 Maximal Clique (25 分) 1142 Maximal Clique (25 分) A clique is a subset of vertices of an undirected graph such that eve 阅读全文

posted @ 2019-05-04 09:30 村雨sup 阅读(124) 评论(0) 推荐(0)