COSC
hw4_graph-search-1.pdf

# hw4_graph-search-1.pdf - COSC2430 Programming and Data...

• Homework Help
• 2

This preview shows pages 1–2. Sign up to view the full content.

COSC2430: Programming and Data Structures Homework 4: Shortest Path in Graph 1 Introduction You will create a C++ program to find the shortest path given a source vertex and destination vertex. 2 Input and Output G = ( V, E ) is a directed graph, where n vertices and m edges. G can be represented as an adjacency matrix E, n × n , where n < = 10000. Please see Figure 1 as an example. You will read a sparse matrix E from an input file; There will be ONE matrix entry per line in the input file and each line will have a triplet of numbers i, j, length where 1 i, j n indicate the entry and length denotes the length for a directed edge pointing from vertex i to j . Given a source vertex 1 s n and

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

This is the end of the preview. Sign up to access the rest of the document.
• Spring '17
• Rizl

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern