文本文档HW2-计算机科学与导论-思想与方法.zip(国外英文资料).docVIP

文本文档HW2-计算机科学与导论-思想与方法.zip(国外英文资料).doc

  1. 1、本文档共15页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
文本文档HW2-计算机科学与导论-思想与方法.zip(国外英文资料)

文本文档HW2-计算机科学与导论-思想与方法.zip(国外英文资料) Why does it say that scientific research starts with the problem? A: scientific research starts with problems, or science begins with questions rather than observations. Although observation can lead to problems, there must be a problem in observation, with the expected assumption that there is no such thing as an aimless observation. How does 2.2 eola abstract the seven bridge problem in konigsberg? Answer: in order to solve the problem of gothic at seven bridge, euler with four points on behalf of the city, for the four points with seven lines between four city seven Bridges, so as to get a contains four points and seven lines of undirected graph. It is based on the nature of the problem to consider, it is the most essential thing, and abstract the problem ignored the nature of the problem not (such as the length of the bridge, wide degree, etc.). In the end, the problem of the seven-bridge problem in konigsberg was abstract as a mathematical problem, which is the loop problem that is only once and once on each side of the diagram. Euler argued in the paper that such a circuit does not exist, and that the graph of the circuit is called euler. The difference between euler circuit and Hamilton loop is briefly described. Answer: Hamilton loop problem are nodes outside each visit in addition to the original departure once and only once and return to the starting point, and the euler loop problems is to visit every side And only once and return to the starting point. About the existence of any given graph euler loop front has sufficient and necessary conditions are given, and for any given graph whether there is a Hamilton loop has not been found to meet the necessary and sufficient condition of the problem. To determine which of the following graphs exists the euler path, which has the euler circuit. Answer: a, b, c, d all exist in the euler path, and a exists in the euler circuit. Determine which of the following diagrams exists in

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档