Question: 1-What graph traversal algorithm uses a stack to keep track of vertices that need to be processed? a Depth First Search b Minimum Spanning Tree

1-What graph traversal algorithm uses a stack to keep track of vertices that need to be processed?

a

Depth First Search

b

Minimum Spanning Tree

c

Breadth First Search

d

Topological Sort

2-

Topological sort can be applied to which of the following graphs?

a

Undirected Acyclic Graphs

b

Directed Cyclic Graphs

c

Directed Acyclic Graphs

d

Undirected Cyclic Graphs

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!