Scribd Logo
Upload

Welcome to Scribd!

  • Primsoutput

    Uploaded by

    Gayatri Jethani
    10 views1 page
    The document describes applying Kruskal's algorithm to find the minimum spanning tree of a graph with 6 vertices and 18 edges. The algorithm selects the edges (3,2), (3,1), (1,4), (1,0), and (3,5) in that order, with a total cost of 18.

    Original Description:

    Original Title

    primsoutput (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes applying Kruskal's algorithm to find the minimum spanning tree of a graph with 6 vertices and 18 edges. The algorithm selects the edges (3,2), (3,1), (1,4), (1,0), and (3,5) in that order, with a total cost of 18.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views1 page

    Primsoutput

    Uploaded by

    Gayatri Jethani
    The document describes applying Kruskal's algorithm to find the minimum spanning tree of a graph with 6 vertices and 18 edges. The algorithm selects the edges (3,2), (3,1), (1,4), (1,0), and (3,5) in that order, with a total cost of 18.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Enter number of vertices

    Enter adjacenc matrix


    0 3 11 0 0 0
    3 0 5 4 2 0
    11 5 0 1 0 0
    0 4 1 0 10 8
    0 2 0 10 0 9
    0 0 0 8 9 0

    Graph is...
    0 3 11 0 0 0
    3 0 5 4 2 0
    11 5 0 1 0 0
    0 4 1 0 10 8
    0 2 0 10 0 9
    0 0 0 8 9 0
    No.of vertex : 6
    No.of Edges : 18

    After initialization....
    visited [] : 0 0 0 0 0 0
    d array [] : 9999 9999 9999 9999 9999 9999
    p array [] : -1 -1 -1 -1 -1 -1

    Enter starting vertex : 3

    order in which edges are selected in MST:

    Edge (3,2)
    Edge (3,1)
    Edge (1,4)
    Edge (1,0)
    Edge (3,5)

    Final Values are ....


    visited [] : 1 1 1 1 1 1
    d array [] : 3 4 1 0 2 8
    p array [] : 1 3 3 -1 1 3

    Edges in minimum spanning tree are :

    Edge (1,0) : 3
    Edge (3,1) : 4
    Edge (3,2) : 1
    Edge (1,4) : 2
    Edge (3,5) : 8

    Total Cost : 18

    Printing Path
    path from 3 to 0 is 3 --> 1 --> 0
    path from 3 to 1 is 3 --> 1
    path from 3 to 2 is 3 --> 2
    path from 3 to 4 is 3 --> 1 --> 4
    path from 3 to 5 is 3 --> 5

    You might also like