{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

3 the number of vertices start numerating vertices

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

View Full Document Right Arrow Icon
in comments but you do not need to use comments in your data file.) 3 / * = the number of vertices * / / * start numerating vertices from 1 * / / * for a given vertex list all adjacent vertices and weights end by -1 * / / * format: vertex, adjacent_vertex, weight, adjacent_vertex, weight,..., -1 * / 1 2 5 3 2 -1 2 3 4 -1 3 -1 -1 / * end of file * / Display the graph in a similar format on the screen. Ask the user about the source and destination vertices in a graph. Display the value of the shortest path along with all the intermediate vertices with weights starting at the source and ending at the destination. Example: 2 6 1 S ----> A ----> B ----> D Total wight of the shortest path from S to D = 9 Display the total number of comparisons in order to compare the performance of the Dijkstra’s algorithm. You should count * the number of comparisons to remove minimum and restructure the heap after this operation * the number of comparisons used to find/update and decrease element key value in the priority queue and its heap representation. 2
Background image of page 2

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

View Full Document Right Arrow Icon
Report In addition to the regular programming assignment report you should include answers to the following problems.
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}