spr_sysprob6

Spr_sysprob6 - Unified Computers Programming Spring 2006 Professor Kristina I Lundqvist SPL 6 Graphical Dijkstra's Algorithm Out Thursday March

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Unified Computers & Programming, Spring 2006 Professor Kristina I. Lundqvist SPL 6: Graphical Dijkstra’s Algorithm Out: Thursday, March 16 th ; Due: Thursday, March 23 rd I. Objectives Primary Objective: Improve your understanding of pointers through the implementation of a Dijkstra’s algorithm. Secondary Objectives: File parsing – File I/O. A look at more advanced File Parsing which includes files with comments and multiple values on a single line, separated by commas, a.k.a. CSV/CDV (Comma Separated/Delimited Values). Practice code reuse Practice with Graphics Library. Debugging with PUT II. Files Downloads - Please go to the Unified C&P Website and download the file under “Systems Problem Support” (If you haven’t already installed them, you may also need “ and ): “C&P_SPL_6.zip” Included files: “double_buffer.ads & double_buffer.adb” “test_dijkstra.adb” “dijkstra.txt” “dijkstra_input_generator.exe” “test_ dijkstra.exe” “test_ada_graphics.exe” “gnat.ago” Files you will have to modify (you are allowed to modify any of them): “test_dijkstra.adb” Page 1 of 7
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Unified Computers & Programming, Spring 2006 Professor Kristina I. Lundqvist III. Overview This System Problem is similar to the previous system problem in that you will be dealing with file i/o, graphics, and code reuse. You will be required to answer a series of questions on how some of the code works and then write ONE procedure: Draw_Dijkstra, your implementation of the algorithm. The end result of your coding efforts will be two graphic windows, one displaying Nodes connected by Links/Edges and the Dijkstra algorithm trying to find the shortest path, the other will display the Priority Queue that the algorithm uses. The final result should be similar to “ test_dijkstra.exe .” You can run (double click on) “ dijkstra_input_generator.exe ” to generate a new input file (“ Dijkstra.txt ”) for “ test_dijkstra.exe .” Dijkstra.txt # Lines that start with a Pound Sign are Comments Nodes: # Node 1 257,694 # Node 2 91,545 # Node 3 55,350 Links: # Links from Node 1 to other Nodes 42.238, 0.020, 5.083, 59.964, 83.532, 12.792, # Links from Node 2 to other Nodes 87.260, 34.939, 59.386, 28.459, 94.082, # Links from Node 3 to other Nodes 40.689, 18.619, 74.831, 84.997, Figure 1: Dijkstra.txt ” can be randomly generated by “ dijkstra _input_generator.exe ”.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/28/2012 for the course AERO 16.01 taught by Professor Markdrela during the Fall '05 term at MIT.

Page1 / 7

Spr_sysprob6 - Unified Computers Programming Spring 2006 Professor Kristina I Lundqvist SPL 6 Graphical Dijkstra's Algorithm Out Thursday March

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online