Metadata-Version: 2.1
Name: DSApy
Version: 0.1
Summary: This helps in using of different data structure and algorithms
Home-page: https://github.com/Soumya-Chakraborty/DSApy
Author: Soumya Chakraborty
Author-email: soumyachakraborty198181@gmail.com
Classifier: Programming Language :: Python :: 3
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Requires-Python: >=3.6
Description-Content-Type: text/markdown
License-File: LICENSE

# DSAPy

<p align=center>
<img src="https://img.shields.io/badge/Python-FFD43B?style=for-the-badge&logo=python&logoColor=blue">
<a href="https://github.com/Soumya-Chakraborty/DSApy/releases"><img src="https://badgen.net/github/release/Soumya-Chakraborty/DSApy">
<a href="https://github.com/Soumya-Chakraborty/DSApy/graphs/commit-activity"><img src="https://img.shields.io/badge/Maintained%3F-yes-green.svg">
<a href="https://github.com/Soumya-Chakraborty/DSApy/blob/main/LICENSE"><img src="https://img.shields.io/github/license/Soumya-Chakraborty/DSApy ">

DSAPy is a Python package that provides implementations of various data structures and algorithms.

## Installation

You can install DSAPy using pip:

```
pip install DSAPy
```

## Features

DSAPy currently includes the following data structures and algorithms:

- Stack
- Queue
- Linked List
- Binary Tree
- Graph
- Searching algorithms (e.g., linear search, binary search)
- Sorting algorithms (e.g., bubble sort, merge sort)

## Usage

Here's a quick example of how to use DSAPy:

```python
from DSAPy.dataStructure import Stack, Queue, LinkedList, Tree, Graph

# Create a stack
stack = Stack()
stack.push(1)
stack.push(2)
print(stack.pop())  # Output: 2

# Create a queue
queue = Queue()
queue.enqueue(1)
queue.enqueue(2)
print(queue.dequeue())  # Output: 1

# Create a linked list
linked_list = LinkedList()
linked_list.add_first(1)
linked_list.add_last(2)
linked_list.print_list()  # Output: 1 2

# Create a binary tree
tree = Tree()
tree.add(5)
tree.add(3)
tree.add(8)
tree.print_tree()  # Output: 3 5 8

# Create a graph
graph = Graph()
graph.add_vertex('A')
graph.add_vertex('B')
graph.add_edge('A', 'B')
graph.print_graph()  # Output: A : ['B']
```

## Contributing

Contributions are welcome! If you'd like to contribute to DSAPy, please feel free to submit pull requests or raise issues on GitHub.

## License

This project is licensed under the MIT License. See the [LICENSE](LICENSE) file for details.
```

Feel free to customize it further according to your preferences and add more detailed explanations, examples, or sections as needed.
