Question: 1. What is a directed graph? What is an undirected graph? Define adjacent nodes? 2. Discuss algorithms of Breadth First Search (BFS) and Depth First
1. What is a directed graph? What is an undirected graph? Define adjacent nodes?
2. Discuss algorithms of Breadth First Search (BFS) and Depth First Search (DFS) traversal for a Graph. Explain with an example.
3. Explain Difference between BFS and DFS.
4. Explain a minimum spanning tree with suitable example.
5. Explain Kruskal’s algorithm with suitable example.
Step by Step Solution
There are 3 Steps involved in it
The detailed answer for the above question is provided below 1 Directed Path is a set of vertices and a collection of directed edges that each connects an ordered pair of vertices Unidirected Path a s... View full answer
Get step-by-step solutions from verified subject matter experts
