Scribd
Upload
105 views1 page

Research On The Following Topics Warshall's Algorithm Dijk-Stra Methods (Shortest Path) Traversing Graphs Given The Following Graph Representation

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.

Uploaded by

Keith Tanaka Magaka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
105 views1 page

Research On The Following Topics Warshall's Algorithm Dijk-Stra Methods (Shortest Path) Traversing Graphs Given The Following Graph Representation

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.

Uploaded by

Keith Tanaka Magaka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 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