电子文档交易市场
安卓APP | ios版本
电子文档交易市场
安卓APP | ios版本

算法课件Lecture2章节

57页
  • 卖家[上传人]:E****
  • 文档编号:91095534
  • 上传时间:2019-06-21
  • 文档格式:PPT
  • 文档大小:379KB
  • / 57 举报 版权申诉 马上下载
  • 文本预览
  • 下载提示
  • 常见问题
    • 1、Lecture 2 Elementary Graph Algorithms,Breadth-First Search Algorithm And Depth-First Search Algorithm, 2005 SDU 2,Breadth-first search (outline),The single source shortest-paths problem for unweighted graph The Breadth-first search algorithm The running time of BFS algorithm The correctness proof Note: We only introduce BFS for undirected graphs. But it also works for directed graphs.,Archetype for Prims minimum-spanning-tree algorithm Archetype for Dijkstras shortest-paths algorithm, 2005 SDU 3

      2、,Shortest paths,Example: 3 simple paths from source s to b: , , of length 1, 2, 3, respectively. So the shortest path from s to b is . The shortest paths from s to other vertices a, e, d, c are: , , , . There are two shortest paths from s to d., 2005 SDU 4,The shortest-paths problem,Distance dv: The length of the shortest path from s to v. For example dc=2. Define ds=0. The problem: Input: A graph G = (V, E) and a source vertex sV Output: A shortest path from s to each vertex v V and the distanc

      3、e dv., 2005 SDU 5,What does the BFS do?,Given a graph G = (V, E), the BFS returns: The shortest distance dv from s to v The predecessor or parent v, which is used to derive a shortest path from s to vertex v.( see back ) BFS actually returns a shortest path tree in which the unique simple path from s to node v is a shortest path from s to v in the original graph. In addition to the two arrays dv and v, BFS also uses another array colorv, which has three possible values: WHITE: represented “undis

      4、covered” vertices; GRAY: represented “discovered” but not “processed” vertices; BLACK: represented “processed” vertices., 2005 SDU 6,The Breadth-First Search,The idea of the BFS: Each time, search as many vertices as possible. Visit the vertices as follows: Visit all vertices at distance 1 Visit all vertices at distance 2 Visit all vertices at distance 3 Initially, s is made GRAY, others are colored WHITE. When a gray vertex is processed, its color is changed to black, and the color of all white

      5、 neighbors is changed to gray. Gray vertices are kept in a queue Q., 2005 SDU 7,The Breadth-First Search (more details),G is given by its adjacency-lists. Initialization: First Part: lines 1 4 Second Part: lines 5 - 9 Main Part: lines 10 18 Enqueue(Q, v): add a vertex v to the end of the queue Q Dequeue(Q): Extract the first vertex in the queue Q, 2005 SDU 8,Example of Breadth-First Search,Problem: given the undirected graph below and the source vertex s, find the distance dv from s to each vert

      6、ex v V, and the predecessor v along a shortest path by the algorithm described earlier., 2005 SDU 9,Example(Continued),Initialization,b,s,d,c,a,f,e,Q = (put s into Q (discovered), mark s gray (unprocessed),0, 2005 SDU 10,Example(continued),While loop, first iteration Dequeue s from Q. Find Adjs= Mark b,e as “G” Update db, de, b, e Put b, e into Q Mark s as “B” Q=,b,s,d,c,a,f,e,0,1,1, 2005 SDU 11,Example(continued),While loop, second iteration Dequeque b from Q, find Adjb= Mark a, c, f as “G”, Up

      7、date da, dc, df, a, c, f Put a, c, f into Q Mark b as “B” Q=,b,s,d,c,a,f,e,0,1,1,2,2,2, 2005 SDU 12,Example(continued),While loop, third iteration Dequeque e from Q, find Adje= Mark d as “G”, mark e as “B” Update dd, d, Put d into Q Q=, 2005 SDU 13,Example(continued),While loop, fourth iteration Dequeque a from Q, find Adja= mark a as “B” Q=,b,s,d,c,a,f,e,0,1,1,2,2,2,2, 2005 SDU 14,Example(continued),While loop, fifth iteration Dequeque c from Q, find Adjc= mark c as “B” Q=, 2005 SDU 15,Example(

      8、continued),While loop, sixth iteration Dequeque f from Q, find Adjf= mark f as “B” Q=, 2005 SDU 16,Example(continued),While loop, seventh iteration Dequeque d from Q, find Adjd= mark d as “B” Q is empty, 2005 SDU 17,Example(continued),While loop, eighth iteration Since Q is empty, stop, 2005 SDU 18,Example(continued),Question: How do you construct a shortest path from s to any vertex by using the following table?, 2005 SDU 19,The Answer, 2005 SDU 20,Analysis of the Breadth-First Search Algorithm,We assume that it takes one unit time to test the color of a vertex, or to update the color of a vertex, or to compute dv = du + 1, or to set v = u, or to enqueue, or to

      《算法课件Lecture2章节》由会员E****分享,可在线阅读,更多相关《算法课件Lecture2章节》请在金锄头文库上搜索。

      点击阅读更多内容
    最新标签
    发车时刻表 长途客运 入党志愿书填写模板精品 庆祝建党101周年多体裁诗歌朗诵素材汇编10篇唯一微庆祝 智能家居系统本科论文 心得感悟 雁楠中学 20230513224122 2022 公安主题党日 部编版四年级第三单元综合性学习课件 机关事务中心2022年全面依法治区工作总结及来年工作安排 入党积极分子自我推荐 世界水日ppt 关于构建更高水平的全民健身公共服务体系的意见 空气单元分析 哈里德课件 2022年乡村振兴驻村工作计划 空气教材分析 五年级下册科学教材分析 退役军人事务局季度工作总结 集装箱房合同 2021年财务报表 2022年继续教育公需课 2022年公需课 2022年日历每月一张 名词性从句在写作中的应用 局域网技术与局域网组建 施工网格 薪资体系 运维实施方案 硫酸安全技术 柔韧训练 既有居住建筑节能改造技术规程 建筑工地疫情防控 大型工程技术风险 磷酸二氢钾 2022年小学三年级语文下册教学总结例文 少儿美术-小花 2022年环保倡议书模板六篇 2022年监理辞职报告精选 2022年畅想未来记叙文精品 企业信息化建设与管理课程实验指导书范本 草房子读后感-第1篇 小数乘整数教学PPT课件人教版五年级数学上册 2022年教师个人工作计划范本-工作计划 国学小名士经典诵读电视大赛观后感诵读经典传承美德 医疗质量管理制度 2 2022年小学体育教师学期工作总结 2022年家长会心得体会集合15篇
    关于金锄头网 - 版权申诉 - 免责声明 - 诚邀英才 - 联系我们
    手机版 | 川公网安备 51140202000112号 | 经营许可证(蜀ICP备13022795号)
    ©2008-2016 by Sichuan Goldhoe Inc. All Rights Reserved.