文件名称:SavageAndMonksProblem
- 所属分类:
- 数据结构常用算法
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 26kb
- 下载次数:
- 0次
- 提 供 者:
- 常**
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
野人和修道士问题。(要求用图的邻接表的存储结构实现)
题目:假设有N个修道士和N个野人准备渡河,为了防止野人侵犯修道士,要耱无论在何处,修道士的人数不得少于野人的个数(除非修道士个数为0)他们两个都会划船-Savage and monks problems. (Required to use the adjacency list graph storage structure) Title: The assumption that N and N of monks prepare a wild man to cross the river in order to prevent the savage violations of monks, it is necessary to耱wherever, the number of monks should not be less than Savage
题目:假设有N个修道士和N个野人准备渡河,为了防止野人侵犯修道士,要耱无论在何处,修道士的人数不得少于野人的个数(除非修道士个数为0)他们两个都会划船-Savage and monks problems. (Required to use the adjacency list graph storage structure) Title: The assumption that N and N of monks prepare a wild man to cross the river in order to prevent the savage violations of monks, it is necessary to耱wherever, the number of monks should not be less than Savage
相关搜索: 修道士
(系统自动生成,下载前可以参看下载内容)
下载文件列表
野人和修道士问题
................\Graph.cpp
................\Graph.dsp
................\Graph.dsw
................\Graph.ncb
................\Graph.opt
................\Graph.plg
................\MVC5.tmp
................\SeqCQueue.h
................\野人和修道士问题.dsp
................\野人和修道士问题.dsw
................\野人和修道士问题.ncb
................\野人和修道士问题.opt
................\野人和修道士问题.plg
................\Graph.cpp
................\Graph.dsp
................\Graph.dsw
................\Graph.ncb
................\Graph.opt
................\Graph.plg
................\MVC5.tmp
................\SeqCQueue.h
................\野人和修道士问题.dsp
................\野人和修道士问题.dsw
................\野人和修道士问题.ncb
................\野人和修道士问题.opt
................\野人和修道士问题.plg