Feature: Comprehensive Graph Traversal Algorithms Implementation

[yashsaha555]

📋 Issue Summary

CRITICAL MISSING FEATURE: Java implementation of fundamental graph traversal algorithms (BFS/DFS)

🔍 Problem Identified

The repository has graph algorithms in C++ but completely lacks basic graph traversal implementations in Java, creating a major educational gap.

Current State:

• ✅ C++ has: BFS.cpp, DFS.cpp in /C++/graph/ folder
• ✅ Java has: Dijkstra, TopologicalSort (advanced algorithms)
• ❌ Java missing: BFS, DFS (fundamental algorithms)

✅ Solution Implemented

📁 New File: Java/GraphTraversal.java

Comprehensive implementation featuring:

🏗️ Core Components

1. Graph Data Structure

   • Adjacency list representation
   • Support for both directed and undirected graphs
   • Efficient edge addition and neighbor retrieval

2. Breadth-First Search (BFS)

   • Standard BFS traversal
   • Shortest path finding in unweighted graphs
   • Level-order exploration using Queue

3. Depth-First Search (DFS)

   • Recursive implementation
   • Iterative implementation using Stack
   • Path exploration and backtracking

🚀 Advanced Features

4. Connected Components Detection

   • Find all connected components in undirected graphs
   • Graph connectivity analysis

5. Cycle Detection

   • Detect cycles in undirected graphs using DFS
   • Back edge detection algorithm

6. Interactive Demonstrations

   • Pre-built sample graphs
   • Interactive graph creation
   • Multiple traversal examples

[yashsaha555]

Please assign this issue to me @yashsaha555 for Hacktoberfest 2025 contribution.