Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Graph Representations and Traversals (a) Write pseudo-code for an algorithm that performs depth first search of a directed graph: G - (V, E) and prints
Graph Representations and Traversals
(a) Write pseudo-code for an algorithm that performs depth first search of a directed graph: G - (V, E) and prints out all of the edges visited. [10 marks] (b) The following questions relate to traversals of directed graphs i. The graph-search algorithms shown in lectures always keep track of visited nodes because failing to to do so can result in non termination. Draw a graph that will lead to non-termination of Depth-First-Search if we fail to keep track of nodes already vis- ited. [3 marks] ii. Under what conditions can the Single-Source-Shortest-Path prob- lem be solved using Breadth-First-Search? [2 marks] (c) When is it advantageous in terms of memory-use to store a graph as an adjacency list rather than an adjacency matrix? Briefly justify your answer. 2 marks]Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started