CQUPT – University at AlbanyComputer Science – International CollegeCSI 403 --- Algorithms and Data StructuresProgramming Assignment 4 --- Fall 2018 (Draft Copy)Purpose of the ProjectThe primary goal of this exercise is to develop skills to work with graphs. A secondary goal is to apply Dijkstra’s algorithm to compute the shortest path for problem represented as a graph.DescriptionYou will be given data in the form of nodes and edges. The first line of the data file is the number of nodes. Nodes are identified by integers and will go from 0 to the number of nodes – 1. Next is the start node. Following the start node is a list of edges and weights. Each line will contain a source node, destination node, and a weight (real number). The end of data is marked by the end of file.DetailsThe input data may represent cities. You are to use the Dijkstra’s algorithm to determine the shortest path for graphs that are described by the format defined in this exercise. Your solution must work for graphs that have at most 100 nodes. You are to use the Priority Queue you have designed for your last Programming Assignment, Project 3. You must add a header file mypq.h to your solution. This file will contain the C/C++ function declarations and any macro definitions that are associated with your priority queue implementation and will be shared by other source files, used for your solution, that require a priority queue. Your solution will have the #include “mypq.h” statement as part of the header declaration of the components that manipulate the priority queue.Input Data Format ExampleThe data in your testing files must follow the format here defined. The example that follows illustrate the format to be used.610 1 12.00 2 8.50 3 5.52 4 4.04 5 10.03 5 15.0Output FormatYour solution must report the shortest-length path for CQUPT留学生作业代写、代做C/C++实验作业、代写Data Structure作业、代做C/C++作业 代写留学生Pall nodes starting from the defined origin as determined by the associated input file. You are to place your solution in a text file. The format to be followed is described below for a graph with 5 vertices , and S as the start node. Note: Both the path and the integers used for the example below are just for the description of the format to be used. The shortest-length path is: S = 0; path = T = 4; path = X = 9; path = Y = 5; path = Z = 7; path = How to Submit your Work?Your solutions must be submitted to the address provided by your co-instructor.?Your files for the Project4 must include the source code for all modules used for the exercise as well as an executable file to allow your solution to be tested. You must include all your source files in a Compressed (zipped) folder (.zip). Your (.zip) folder as well as the subject of your message must follow the format: Project 4 Your Name. Marks will be deducted if you do not follow this requirement.Due DateThe project is due on Friday, December 21st, 2018. ExpectationYour program should be layered, modularized and well commented. The following is a tentative marking scheme and what is expected to be submitted for this assignment:1.External Documentation including [5-10 pages]a.Title pageb.A table of contentsc.[10%] System documentationi.A high-level data flow diagram for the systemii.A list of routines and their brief descriptionsiii.Implementation detailsd.[5%] Test documentationi.How you tested your programii.Testing outputse.[5%] User documentationi.Where is your sourceii.How to run your programiii.Describe parameter (if any)2.Source Codea.[75%] Correctnessb.[ 5% ] Programming stylei.Layeringii.Readabilityiii.Commentsiv.Efficiency转自：http://ass.3daixie.com/2018122139915897.html
网友评论