Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Bfdfout

    Uploaded by

    shameedp
    The document discusses breadth first traversal and depth first traversal in graphs. It provides an example of a graph with 4 nodes and asks the user to input the adjacent matrix. It then performs BFS and DFS on the graph, outputting the order that the nodes are visited for each traversal method. BFS visits the nodes in order of 1, 2, 3, 4 while DFS visits them in the order of 1, 3, 2, 4.

    Copyright:

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

    You might also like

    Bfdfout

    Uploaded by

    shameedp
    16 views1 page
    The document discusses breadth first traversal and depth first traversal in graphs. It provides an example of a graph with 4 nodes and asks the user to input the adjacent matrix. It then performs BFS and DFS on the graph, outputting the order that the nodes are visited for each traversal method. BFS visits the nodes in order of 1, 2, 3, 4 while DFS visits them in the order of 1, 3, 2, 4.

    Original Description:

    Original Title

    bfdfout

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses breadth first traversal and depth first traversal in graphs. It provides an example of a graph with 4 nodes and asks the user to input the adjacent matrix. It then performs BFS and DFS on the graph, outputting the order that the nodes are visited for each traversal method. BFS visits the nodes in order of 1, 2, 3, 4 while DFS visits them in the order of 1, 3, 2, 4.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    16 views1 page

    Bfdfout

    Uploaded by

    shameedp
    The document discusses breadth first traversal and depth first traversal in graphs. It provides an example of a graph with 4 nodes and asks the user to input the adjacent matrix. It then performs BFS and DFS on the graph, outputting the order that the nodes are visited for each traversal method. BFS visits the nodes in order of 1, 2, 3, 4 while DFS visits them in the order of 1, 3, 2, 4.

    Copyright:

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

    BREADTH FIRST AND DEPTH FIRST TRAVERSAL IN GRAPH

    OUTPUT:

    Ente r the no . o f nodes


    4:

    Ente r the ad jacen t matr i x :

    Ente r the va lue o f the 1 ,2 e lement


    0 :

    Ente r the va lue o f the 1 ,3 e lement


    1 :

    Ente r the va lue o f the 2 ,1 e lement


    0 :

    Ente r the va lue o f the 2 ,3 e lement


    0 :

    Ente r the va lue o f the 3 ,1 e lement


    1 :

    Ente r the va lue o f the 3 ,2 e lement


    0 :

    Ente r the va lue o f the 4 ,1 e lement


    1 :

    Ente r the va lue o f the 4 ,2 e lement


    1 :

    Ente r the va lue o f the 4 ,3 e lement


    1 :

    Nodes a re v i s i ted i n th i s orde r :

    BFS - >1->2->3->4

    DFS- >1->3->2->4

    1 | Page bfdf o/p

    You might also like