Data Representation Methods UF CISE数据表示方法超精细.pptVIP

下载本文档

2
0
约4.82千字
约 21页
2017-02-10 发布于上海
举报
版权申诉

Data Representation Methods UF CISE数据表示方法超精细.ppt

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

Shortest Path Problems Directed weighted graph. Path length is sum of weights of edges on path. The vertex at which the path begins is the source vertex. The vertex at which the path ends is the destination vertex. Example A path from 1 to 7. Example Another path from 1 to 7. Shortest Path Problems Single source single destination. Single source all destinations. All pairs (every vertex is a source and destination). Single Source Single Destination Possible greedy algorithm: Leave source vertex using cheapest/shortest edge. Leave new vertex using cheapest edge subject to the constraint that a new vertex is reached. Continue until destination is reached. Greedy Shortest 1 To 7 Path Single Source All Destinations Need to generate up to n (n is number of vertices) paths (including path from source to itself). Greedy method: Construct these up to n paths in order of increasing length. Assume edge costs (lengths) are = 0. So, no path has length 0. First shortest path is from the source vertex to itself. The length of this path is 0. Greedy Single Source All Destinations Greedy Single Source All Destinations Greedy Single Source All Destinations Let d(i) (distanceFromSource(i)) be the length of a shortest one edge extension of an already generated shortest path, the one edge extension ends at vertex i. The next shortest path is to an as yet unreached vertex for which the d() value is least. Let p(i) (predecessor(i)) be the vertex just before vertex i on the shortest one edge extension to i. Greedy Single Source All Destinations Greedy Single Source All Destinations Greedy Single Source All Destinations Greedy Single Source All Destinations Greedy Single Source All Destinations Greedy Single Source All Destinations Greedy Single Source All Destinations Single Source Single Destination Terminate single source all destinations greedy algorithm as soon as shortest path to desired vertex has been generated. Data Structures For Dijkstra’s Algorithm The greedy single source all