Add graph traversal algorithms

[faheel]

Create a folder named Graph in the root directory. Inside it, the following graph traversal algorithms are to be added:

• Breadth-first search (in Traversal/BreadthFirstSearch.cpp)
• Depth-first search (in Traversal/DepthFirstSearch.cpp)

Use either an adjacency list (recommended) or an adjacency matrix to implement an undirected weighted graph.

Use STL containers such as std::queue and std::stack for implementing a queue and stack respectively.

Create a header file named Graph.h (in DataStructures/Graph) and implement the basic functions for getting inputs from the user, such as:

• number of vertices
• number of edges
• starting vertex
• edge info (source, destination and weight)

[Dehorser]

I'd love to take this one.

[Dehorser]

How should I represent the vertices? I'm currently using a struct named "vertex."

[Dehorser]

Just kidding. I notice another user has taken this job.

[faheel]

Note

As I mentioned in issue #70, I will be adding 4 classes for directed and undirected graphs using adjacency matrix and adjacency list representations, but only after issue #74 is taken care of.
Once the classes are added, anyone interested in taking this up, or other graph algorithms, can send their PRs. Please wait until then.

[faheel]

Issue #74 is now closed

[faheel]

Closing this since there haven't been any updates for a long time. If you'd like to work on graph traversal algorithms, please open a new issue for each such algorithm.