A graph is a non-linear data structure composed of vertices (also known as nodes) connected by edges. It’s used to represent relationships between entities. Here’s a brief overview:

1. Graph Representation:
   • Vertices: Fundamental units of the graph.
   • Edges: Connect two nodes.
   • Directed Graph: Edges have a direction.
   • Undirected Graph: Edges are bidirectional.
2. Common Graph Traversal Methods:
   • Depth First Search (DFS):
     • Starts at a node and explores as far as possible along each branch before backtracking
     • Implemented using a stack or recursion.
     • Useful for finding connected components, topological sorting, and cycle detection.
   • Breadth First Search (BFS):
     • Traverses level by level, exploring neighbor nodes at each level
     • Implemented using a queue.
     • Useful for shortest path, connected components, and network analysis.