pydscollections 0.1.1

A professional and well-documented data structures package for Python.

pydscollections

pydscollections is a professional, educational, and production-friendly Python package that provides commonly used Data Structures and Algorithms (DSA) building blocks.

Author: Sanjay Saravanan M.Tech (IIT Madras)

Why pydscollections?

• Clean and consistent APIs.
• Strong type hints for better IDE support.
• Thorough inline documentation.
• Easy to install and publish on PyPI.
• Tested with pytest.

Included Data Structures

Linear

• DynamicArray[T]
• Stack[T]
• Queue[T]
• Deque[T]
• SinglyLinkedList[T]

Trees

• BinarySearchTree[T]

Graphs

• Graph[T] (adjacency-list based)

Priority Structures

• MinHeap[T]

Installation

pip install pydscollections

Quick Start

from pydscollections import Stack, Queue, BinarySearchTree

stack = Stack[int]()
stack.push(10)
stack.push(20)
print(stack.pop())   # 20

queue = Queue[str]()
queue.enqueue("a")
queue.enqueue("b")
print(queue.dequeue())  # "a"

bst = BinarySearchTree[int]()
for value in [10, 5, 15, 12]:
    bst.insert(value)

print(12 in bst)          # True
print(list(bst.in_order()))  # [5, 10, 12, 15]

Project Layout

src/pydscollections/
  __init__.py
  linear.py
  tree.py
  graph.py
  heap.py
tests/

License

MIT License