Graph theory
valar丶morghulis
一步一脚印
展开
-
HDOJ-1242-RESCURE(营救公主)【BFS+优先队列】
/* Function Description: HDOJ 1242 Environment: DEV C++ 5.6.3.1 Technique: Version: Author: valar morghulis Date: 20150806 Notes:正难则反,只原创 2015-08-06 20:38:45 · 767 阅读 · 0 评论 -
HDOJ-1016-Prime Ring Problem(素数环)【DFS】
Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.原创 2015-08-06 21:19:39 · 370 阅读 · 0 评论 -
NYOJ-58-最小步数(搜索)
最少步数 时间限制:3000 ms | 内存限制:65535 KB 难度:4 描述 这有一个迷宫,有0~8行和0~8列: 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1原创 2015-08-08 17:33:32 · 501 阅读 · 0 评论