Scribd Logo
Upload

Welcome to Scribd!

  • Tutorial 12 - Graph Algorithms

    Uploaded by

    ashish88bhardwaj_314
    3 views2 pages
    1. Generate a minimum spanning tree of the graph below using Prim's and Kruskal's algorithms, setting node A as the root node. 2. Traverse the graph below using depth first and breadth first algorithms. 3. Perform Dijkstra's single source shortest path algorithm on the graph below, starting at vertex B.

    Original Description:

    hh

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. Generate a minimum spanning tree of the graph below using Prim's and Kruskal's algorithms, setting node A as the root node. 2. Traverse the graph below using depth first and breadth first algorithms. 3. Perform Dijkstra's single source shortest path algorithm on the graph below, starting at vertex B.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    3 views2 pages

    Tutorial 12 - Graph Algorithms

    Uploaded by

    ashish88bhardwaj_314
    1. Generate a minimum spanning tree of the graph below using Prim's and Kruskal's algorithms, setting node A as the root node. 2. Traverse the graph below using depth first and breadth first algorithms. 3. Perform Dijkstra's single source shortest path algorithm on the graph below, starting at vertex B.

    Copyright:

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

    8ev uaLe: 01-03-14

    "#$# %$&'($'&)* + ,-./&0$12*


    34"556789

    ur. lan van der Llnde

    :'$/&0#- 96: Craph AlgorlLhms


    1. use (a) rlm and (b) kruskal algorlLhms Lo generaLe a 30;02'2 %<#;;0;. :&)) (MS1) of Lhe
    graph below, assume LhaL we wlll seL Lhe rooL node Lo be !.



    2. 1raverse Lhe graph shown below uslng (a) depLh flrsL, and (b) breadLh flrsL algorlLhms.




    8ev uaLe: 01-03-14
    3. erform ul[ksLra's %1/&$)*$ =#$1 ,-./&0$12 (SA) on Lhe graph below, sLarLlng aL verLex ,.




    4. Show a valld >#20-$/;0#; =#$1 Lhrough Lhe 2u planar pro[ecLlon of a dodecahedron, below,
    and Lhen a soluLlon Lo Lhe vlcLorlan board-game classlc, Lhe !"#$%&' )&*+ (a >#20-$/;0#;
    ?0&('0$ - a paLh LhaL vlslLs each verLex only /;(), and flnlshes aL a verLex ad[acenL Lo Lhe sLarL
    verLex).

    You might also like