1. 2. Trace the depth-first search pseudocode below on the graph below and show only the...

 

Transcribed Image Text:

1. 2. Trace the depth-first search pseudocode below on the graph below and show only the sequence of vertices visited: dfs (adj, s) { } n = adj.last for (i = 1 to n) { } visit[i] = false dfs_recurs (adj, visit, s) dfs_recurs (adj, visit, v) { visit [v] = true ref = adj [v] while (ref != null) { if (!visit [ref.data]) dfs_recurs (adj, visit, ref.data) ref= ref.next } } // backtrack dfs (adj, start) { n = adj. last for i=1 to n Trace the depth-first search pseudocode below on the graph above and show the vertex visited and the stack at each iteration. visit[i] = false s.push (start) visit [start] = true while (!s. empty()) { v=s.top() ref = adj [v] while (ref != null) { if (!visit [ref.data]) { } EE2108/68 s.push (ref.data) visit [ref.data] = true break } else ref = ref.next } if (ref ==null) s.pop() the start vertex b b h 1. 2. Trace the depth-first search pseudocode below on the graph below and show only the sequence of vertices visited: dfs (adj, s) { } n = adj.last for (i = 1 to n) { } visit[i] = false dfs_recurs (adj, visit, s) dfs_recurs (adj, visit, v) { visit [v] = true ref = adj [v] while (ref != null) { if (!visit [ref.data]) dfs_recurs (adj, visit, ref.data) ref= ref.next } } // backtrack dfs (adj, start) { n = adj. last for i=1 to n Trace the depth-first search pseudocode below on the graph above and show the vertex visited and the stack at each iteration. visit[i] = false s.push (start) visit [start] = true while (!s. empty()) { v=s.top() ref = adj [v] while (ref != null) { if (!visit [ref.data]) { } EE2108/68 s.push (ref.data) visit [ref.data] = true break } else ref = ref.next } if (ref ==null) s.pop() the start vertex b b h

Answer rating: 100% (QA)

dfsadj b Visit sequence b h Stack at each iteration It... View the full answer