vicentin 0.16.2

Personal collection of algorithms.

Vicentin

A Python package showcasing algorithms, data structures, and mathematical concepts.

---

Table of Contents

• Introduction
• Features
• Installation
• Usage
• Pre-commit Setup
• License

---

Introduction

vicentin is a Python package that contains my personal implementations of a variety of algorithms, data structures, and optimization techniques. It serves as a collection of theoretical and practical programming concepts.

---

Features

• Data Structures: Queue, Stack, Tree, Graph, Heap, Priority Queue, Trie, Union Find
• Dynamic Programming: Knapsack, Matrix Chain Multiplication, Rod Cutting
• Graph Algorithms: Minimum Spanning Tree (MST), Shortest Path
• Image Processing: Optical Flow, Differentiation, Regularization
• Optimization: Gradient Descent
• Sorting: Heap Sort
• Mathematical Tools: PCA, Kernel PCA, Polynomial Operations

---

Installation

1️⃣ Clone the Repository

git clone https://github.com/your-username/vicentin.git
cd vicentin

2️⃣ Set Up a Virtual Environment

python -m venv venv
source venv/bin/activate

3️⃣ Install Dependencies

pip install -r requirements.txt

---

Usage

Import the package and use its functionalities in Python scripts.

import vicentin

# Example: Using the heap data structure
from vicentin.data_structures.heap import Heap

heap = Heap()
heap.insert(5)
heap.insert(2)
heap.insert(8)

print(heap.extract_min())  # Output: 2

---

Pre-commit Setup

This repository uses pre-commit to enforce coding standards, automatic formatting and automatic version bumping before commits.

1️⃣ Install pre-commit

pip install pre-commit

2️⃣ Install Hooks

pre-commit install

3️⃣ Use commitizen to commit

cz commit

---

License

This project is licensed under the MIT License.