Java DSA Library

A robust, well-tested, and well-documented Data Structures and Algorithms library implemented in Java.

Overview

This project aims to provide clean and efficient implementations of common data structures and algorithms. It is built as a standard Maven project and uses JUnit 5 for rigorous testing to ensure correctness and reliability.

Project Structure

The project follows the standard Maven directory structure:

• src/main/java: Contains the core implementation of data structures and algorithms.
• src/test/java: Contains the JUnit 5 test cases.

Features (Planned & Implemented)

Data Structures

• Linked Lists (Singly, Doubly, Circular)
• Stacks & Queues
• Trees (Binary Trees, BST, AVL, etc.)
• Graphs
• Hash Tables
• Heaps

Algorithms

• Sorting (Bubble, Merge, Quick, etc.)
• Searching (Linear, Binary)
• Graph Traversal (BFS, DFS)
• Pathfinding (Dijkstra, A*, etc.)
• Dynamic Programming

Prerequisites

• Java Development Kit (JDK) 11 or higher
• Maven 3.6 or higher

Getting Started

1. Clone the repository:

   git clone <your-repository-url>
   cd "DSA Java"

2. Build the project:

   mvn clean install

3. Run the tests:

   mvn test

Contributing

Contributions are welcome! If you'd like to add a new data structure or algorithm, please ensure you include corresponding JUnit tests and update this README if necessary.