Scribd Logo
Upload

Welcome to Scribd!

  • Research on Graph Algorithms: Warshall, Dijkstra, BFS & DFS

    Uploaded by

    Keith Tanaka Magaka
    25 views1 page
    This document discusses graph algorithms and asks to perform breadth-first search (BFS) and depth-first search (DFS) on a graph starting at Anchorage. BFS and DFS are graph traversal algorithms where BFS explores the neighbors of a node first before moving to the next node level while DFS explores the depth of a node before moving to its neighbor nodes.

    Original Description:

    jk

    Original Title

    Graph Ques

    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
    This document discusses graph algorithms and asks to perform breadth-first search (BFS) and depth-first search (DFS) on a graph starting at Anchorage. BFS and DFS are graph traversal algorithms where BFS explores the neighbors of a node first before moving to the next node level while DFS explores the depth of a node before moving to its neighbor nodes.

    Copyright:

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

    Research on Graph Algorithms: Warshall, Dijkstra, BFS & DFS

    Uploaded by

    Keith Tanaka Magaka
    This document discusses graph algorithms and asks to perform breadth-first search (BFS) and depth-first search (DFS) on a graph starting at Anchorage. BFS and DFS are graph traversal algorithms where BFS explores the neighbors of a node first before moving to the next node level while DFS explores the depth of a node before moving to its neighbor nodes.

    Copyright:

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

    Research on the following topics

    Warshalls Algorithm
    Dijk- stra methods ( Shortest Path )
    Traversing Graphs

    Given the following graph representation:-

    Give:
    a) The breadth first search(BFS)
    b) Depth First Search (DFS)
    -starting at Anchorage.

    You might also like