Scribd Logo
Upload

Welcome to Scribd!

  • DFS and BFS Quiz

    Uploaded by

    Frency Jhon San Juan
    72 views2 pages
    Depth First Search would visit City A, then the deepest city connected which is City H, before returning and visiting cities in between. Breadth First Search would visit City A, then all adjacent cities (B, C, D) before going further, ensuring all neighbors of a city are explored before moving deeper.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Depth First Search would visit City A, then the deepest city connected which is City H, before returning and visiting cities in between. Breadth First Search would visit City A, then all adjacent cities (B, C, D) before going further, ensuring all neighbors of a city are explored before moving deeper.

    Copyright:

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

    DFS and BFS Quiz

    Uploaded by

    Frency Jhon San Juan
    Depth First Search would visit City A, then the deepest city connected which is City H, before returning and visiting cities in between. Breadth First Search would visit City A, then all adjacent cities (B, C, D) before going further, ensuring all neighbors of a city are explored before moving deeper.

    Copyright:

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

    1.

    Using Depth First Search and Breadth First Search, show how you can visit all the 9 cities starting from City A up
    to City H.

    A. Depth First Search

    B. Breadth First Search

    You might also like