This repository contains Graph Data Structure concepts and interview problems in Java.
π³ Breadth-First Search (BFS)
π³ Depth-First Search (DFS)
BFS/
DFS/
StepsByKnight/
Images/
queue.offer(start);BFS uses Queue and explores level by level.
dfs(node);DFS uses recursion and explores depth first.
Uses:
- BFS
- 2D Coordinates
- Shortest Path
Neelu Sahai

