A graph data structure consists of vertices(also called as nodes) that are connected to each other via edges or links.

Graphs can be used to represent networks.
For e.g. you can imagine a network of friends being represented as a graph.
Here each node can be a person and each person is friend of another person.

Traversal Algorithms

• Graph: Traverse using Depth First Search - DFS 
• Graph: Traverse using Breadth First Search - BFS 

Path finding Algorithms

• Find all possible paths in a graph from given source to destination nodes 
• Find if a path exists using breadth first search - BFS 
• Find all paths in a graph using DFS recursive 
• Find if a path exists between two nodes in a graph using DFS recursive 