Searching Algorithms [Graph]

[nobita851]

Issue Id you have worked upon -

403

Briefly explain your program logic -

Created adjacency list representation of graph. Used Recursion for Depth First Traversal. Used Queue for Breadth First Traversal.

Screenshots:

Input Graph :
Vertex : Connected Vertices
     0 : [1, 4]
     1 : [2, 3, 4]
     2 : [1, 3]
     3 : [1, 2, 4]
     4 : [0, 1, 3]

Checklist:

• [x] I have mentioned the question as comment in my solution file.
  

• [x] My code follows the guidelines of this project.
  

• [x] I have performed a self-review of my own code.
  

• [x] I have commented my code.
  

• [x] My code gives the correct output.
  

• [x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
  

• [x] I affirm that I strictly follow contributing guidelines and code of conduct.