- 1、本文档共53页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
;;Path and circuit:
Sequence of vertices ? Not good
Sequence of edges ? Not good
Sequence of vertices and edges ? GOOD !
Path always has a direction.;Path and circuit: ;;;;;;A simple graph satisfying ;;Euler’s Classic Problem;;;Note: The problems of Euler path in pseudograph are equivalent to the cases in multigraph.
So sometimes we only talk about multigraph.;;;;A Generalization of the Euler Theorem.;;Hamiltons A Voyage Round the World Puzzle. ;;Note: The problems of Hamilton path in simple graph are equivalent to the cases in pseudograph.
So we only need to consider simple graph here !;;;;;Proof of the sufficient condition of the existence of Hamilton Path. (哈密顿道路存在的充分条件证明);花絮小知识--交错点互斥性质图解
哈密顿道路、回路存在的充分性条件证明基础;;Remark 2;;;;;Some Homework;3. Chinese textbook p35 习题二第三题;4. Chinese textbook p35 习题二第四题;Solution;5a. Chinese textbook p35 习题二 5a提示;5b. Chinese textbook p35 习题二 5b提示;?;8. Chinese textbook p36 习题二第八题: ;10. Chinese textbook p36 习题二第十题:
this is a problem of Hamilton circuit, which can be proved by using the sufficient condition as in ORE’s theorem.;11. Chinese textbook p36 习题二第十一题:
this is also a problem of Hamilton circuit, which can be proved by using the sufficient condition as in ORE’s theorem.;Supplementary 1. Shortest-Path Problem (最短路径)
(in connected weighted simple graph, 6th Edt. English Textbook P649.);Weighted graph:
Graph that has a number assigned to each edge. ;The main idea of Dijkstras algorithm:
正向描述 S 反向思考
V a
a
Take as the induction hypothesis the following assertion: At the kth iteration
the label of every vertex v in S is the length of a shortest path from ‘a’ to this vertex,
the label of every vertex not in S is the length of a shortest path from ‘a’ to this vertex, which only uses vertices in S (besides the vertex itself) . ;Shortest-Path Problems;Example of Dij
文档评论(0)