Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    BCA2060 Exercise 12-SLM

    Uploaded by

    aryanboxer786
    This document provides instructions for writing a C++ program to implement Dijkstra's algorithm to find the shortest path between two vertices in a weighted directed graph. It describes the algorithm's steps: 1) assign infinite labels to all vertices except the source, 2) mark the source with a label of 0, 3) assign the source's value to the last permanent vertex, 4) update vertex labels if a shorter path is found, 5) repeat steps 3-4 until all vertices are permanent, 6) the shortest path value is the terminal vertex's permanent label. The output displays the shortest path between the entered vertices.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    BCA2060 Exercise 12-SLM

    Uploaded by

    aryanboxer786
    12 views2 pages
    This document provides instructions for writing a C++ program to implement Dijkstra's algorithm to find the shortest path between two vertices in a weighted directed graph. It describes the algorithm's steps: 1) assign infinite labels to all vertices except the source, 2) mark the source with a label of 0, 3) assign the source's value to the last permanent vertex, 4) update vertex labels if a shorter path is found, 5) repeat steps 3-4 until all vertices are permanent, 6) the shortest path value is the terminal vertex's permanent label. The output displays the shortest path between the entered vertices.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for writing a C++ program to implement Dijkstra's algorithm to find the shortest path between two vertices in a weighted directed graph. It describes the algorithm's steps: 1) assign infinite labels to all vertices except the source, 2) mark the source with a label of 0, 3) assign the source's value to the last permanent vertex, 4) update vertex labels if a shorter path is found, 5) repeat steps 3-4 until all vertices are permanent, 6) the shortest path value is the terminal vertex's permanent label. The output displays the shortest path between the entered vertices.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    12 views2 pages

    BCA2060 Exercise 12-SLM

    Uploaded by

    aryanboxer786
    This document provides instructions for writing a C++ program to implement Dijkstra's algorithm to find the shortest path between two vertices in a weighted directed graph. It describes the algorithm's steps: 1) assign infinite labels to all vertices except the source, 2) mark the source with a label of 0, 3) assign the source's value to the last permanent vertex, 4) update vertex labels if a shorter path is found, 5) repeat steps 3-4 until all vertices are permanent, 6) the shortest path value is the terminal vertex's permanent label. The output displays the shortest path between the entered vertices.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    Datastructures and Algorithm using C++ Practical

    Exercise 12

    Exercise 12

    Dijkstras Algorithm

    Write a C++ program for implementation of Dijkstras algorithm. Objective: The objectives of this exercise enable you to find the shortest path between two vertices in a graph with the help of Dijkstras algorithm. Procedure and description: This algorithm is used to find the shortest path between the two vertices in a weighted directed graph and it is also very popular and efficient to find each and every path from starting (source) to terminal vertices. Algorithm: vs :Source vertex vt. : Terminal vertex (end vertex) Vr :vertex with label r vs,z: vertex associated with s and z; z intermediate vertices to reach the Terminal vertex w(vi , vj ) : the weight associated with every edge (vi , vj ) Dijkstras algorithm is given below in stepwise manner: Step 1: Assign a temporary label 1 (vi ) = to all vertices except vs Step 2: Mark vs. as permanent by assigning 0 label to it 1(vs.z) = 0 Step 3: Assign value of vs to vr where vr is last vertex to be made permanent. Vr = Vs Step 4: If (vi ) > (vk ) + w(vk , vi ). (vi ) = (vk ) + w (vk , vi ). Step 5: vr = vi Step 6: If vt has temporary label, repeat step 4 to step 5 otherwise the value of vt is permanent label and is equal to the shortest path vs to vt .
    Sikkim Manipal University Page No.: 44

    Datastructures and Algorithm using C++ Practical

    Exercise 12

    Step: 7 Exit. Expected Output: Input: After executing program. Enter input graph, vertices and distance between vertices as a two dimensional matrix. For better understanding a graphical representation is shown below

    Enter any two vertexs between which the shortest path is to be found. Consider vertices as V1 to V3 respectively. Output: the shortest path between V1 to V3 is: 7

    Sikkim Manipal University

    Page No.: 45

    You might also like