复旦大学:《数据结构与算法设计》实验设计_Lab 7. Single-Source Shortest Paths

Lab 7 Single-Source Shortest Paths The Program(or Project) Evaluation and Review Technique, commonly abbreviated PERT, is a statistical tool, used in project management, that is designed to analyze and represent the tasks involved in completing a given project. First developed by the United States Navy in the 1950s,it is commonly used in conjunction with the critical path method or CPM An interesting application of the single-source shortest path algorithms arises in determining critical paths in PERT chart analysis. Edges represent jobs to be performed, and edge weights epresent the times required to perform particular jobs If edge(u, v)enters vertex v and edge(v, x) en job(u, v)must be perform (v, x). A path through this dag re sequence of jobs that must be performed in a particular order. a critical path is a longest path ough the dag, corresponding to the longest time to perfo The Pert chart formulation given above is somewhat unnatural. It would be more natural for vertices to represent jobs and edges to represent sequencing constraints; that is, edge(u, v) would indicate that job u must be performed before job v, weights would then be assigned to vertices, not edges. Write a procedure that can finds a longest path in a directed acyclic graph with weighted ertices in l (1)Algorithm and implemented code(including three use cases)(60% (2)Efficiency of the algorithm(20%) (3)Document(20%) History Program Evaluation and Review Technique The Navys Special Projects Office, charged with developing the Polaris-Submanine weapon system and the Fleet Ballistic Missile capability, has developed a statistical technique for measuring and forecasting progress in research and development programs. This Program Evaluation and Review Technique (code-named PERT) is applied as a decision-making tool designe to save time in achieving end-objectives, and is of particular interest to those engaged in research and development programs for which time is a critical factor The new technique takes recognition of three factors that influence ul achievement of research and development program objectives time, resources, and technical performance specifications. PERT employs time as the variable that reflects planned resource-applications and performance specifications. with units of time as a common denominator, PERT quantifies knowledge about the uncertainties involved in developmental programs requiring effort at the edge of, or beyond. current knowledge of the subject-effort for which litie or no previous experience exists Through an electronic computer, the peRt technique processes data representing the major, finite accomplishments (events)essential to achieve end-objectives the inter-dependence of those events and estimates of time and range of time necessary to complete each activity between two successive events. Such time expectations include estimates of " most like time,optimistic time, and pessimistic time" for each activity. The technique is a management control tool that sizes up the outlook for meeting objectives on time highlights danger signals requiring management decisions reveals and defines both criticalness and slack in the flow plan or the network of sequential activities that must be performed to meet objectives compares current expectations with scheduled completion dates and computes the probability for meeting so and simulates the effects of options for decision- before decision The concept of PERT was developed by an operations research team staffed with representatives from the Operations Research Department of Booz Allen and Hamilton; the Evaluation Office of the Lockheed Missile Systems Division; and Program Evaluation Branch, Special Projects Office, of the Department of the Navy. -Willard Fazar(Head, Program Evaluation Branch, Special Projects Office, U. S Navy). The American Statistician, April 1959
Lab 7 Single-Source Shortest Paths. The Program (or Project) Evaluation and Review Technique, commonly abbreviated PERT, is a statistical tool, used in project management, that is designed to analyze and represent the tasks involved in completing a given project. First developed by the United States Navy in the 1950s, it is commonly used in conjunction with the critical path method or CPM. An interesting application of the single-source shortest path algorithms arises in determining critical paths in PERT chart analysis. Edges represent jobs to be performed, and edge weights represent the times required to perform particular jobs. If edge (u, v) enters vertex v and edge (v, x) leaves v, then job (u, v) must be performed prior to job (v, x). A path through this dag represents a sequence of jobs that must be performed in a particular order. A critical path is a longest path through the dag, corresponding to the longest time to perform an ordered sequence of jobs. The PERT chart formulation given above is somewhat unnatural. It would be more natural for vertices to represent jobs and edges to represent sequencing constraints; that is, edge (u, v) would indicate that job u must be performed before job v. weights would then be assigned to vertices, not edges. Write a procedure that can finds a longest path in a directed acyclic graph with weighted vertices in linear time. Grading (1) Algorithm and implemented code (including three use cases) (60%). (2) Efficiency of the algorithm (20%). (3) Document (20%). History
按次数下载不扣除下载券;
注册用户24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
- 复旦大学:《数据结构与算法设计》实验设计_Lab 6. Greedy Algorithms.pdf
- 复旦大学:《数据结构与算法设计》实验设计_Lab 5. Red-Black Tree.pdf
- 复旦大学:《数据结构与算法设计》实验设计_Lab 4. Binary Search Trees.pdf
- 复旦大学:《数据结构与算法设计》实验设计_Lab 3. Hash Tables.pdf
- 复旦大学:《数据结构与算法设计》实验设计_Lab 2. Divide and Conquer.pdf
- 复旦大学:《数据结构与算法设计》实验设计_Lab 1. Stack.pdf
- 复旦大学:《数据结构与算法设计》考试样卷_2009-2010年度A卷(答案).pdf
- 复旦大学:《数据结构与算法设计》考试样卷_2009-2010年度A卷(试卷).pdf
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)移动商务介绍(概念及其特点、移动商务与电子商务、价值链及商业模式).ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)无线局域网补充删节版本.ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)移动电话通信原理(补充资料).ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)Wide Area Networks(WANs).ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)Ethernet LANs.ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)Topics Covered(胥正川).ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)Networked Applications.ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)Network Management.ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)Security.ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)TCP/IP Internetworking.ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)TCP/IP Internetworking.ppt
- 复旦大学:《计算机网络 Computer Networking》课程教学资源(PPT课件讲稿)TCP/IP Internetworking.ppt
- 复旦大学:《数据结构与算法设计》实验设计_Lab 8. String Matching.pdf
- 复旦大学:《数据结构与算法设计》综合项目_Project1. Combining quicksort with insertion sort.pdf
- 复旦大学:《数据结构与算法设计》综合项目_Project2. English-Chinese dictionary based on binary search tree.pdf
- 复旦大学:《数据结构与算法设计》综合项目_Project3. All-pairs shortest path.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 01 Algorithm analysis and recurrences.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 02 Divide-and-conquer design paradigm.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 03 Basic data structure - Elementary data structures.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 04 Soring.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 05 Hash tables.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 06 Binary search trees.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 07 Amortized analysis.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 08 Dynamic programming.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 09 Greedy algorithms.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 10 Graph algorithms.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 11 String Matching.pdf
- 复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 12 NP-complete problems.pdf
- 复旦大学:《计算机网络 Computer Networking》课程教学资源_考试样卷.doc
- 复旦大学:《计算机网络 Computer Networking》课程教学资源_各章节练习题.docx
- 复旦大学:《计算机网络 Computer Networking》课程教学资源_考试样卷.doc
- 《计算机网络》课程教学资源(参考文献)END-TO-END ARGUMENTS IN SYSTEM DESIGN.pdf