slav-eeik-datastructures 0.5.1

Simple datastructures library with documentation.

Python Data Structures by slav_EEik

About the project

This is a simple datastructures and algorithms library. It is also published on PyPi.

You can see the automatically-generated documentation on GitHub Pages.

Here are all implemented datastructures:

• Lists

  • Singly Linked List
  • Doubly Linked List
  • Static Array

• Linear Structures

  • Stack
  • Queue
  • Deque

• Heaps

  • Min Heap
  • Priority Queue

• Trees and Tree Nodes

  • Binary Tree
  • Balancing Tree
  • Binary Search Tree
  • Red Black Tree
  • Segment Tree
  • AVL Tree
  • Trie

• Graphs

  • Adjacency List
  • Adjacency Matrix

You can also utilize nodes of these structures in your projects.

Here are all implemented algorithms:

• Sorting Algorithms:

  • Heap Sort
  • Bubble Sort
  • Quick Sort
  • Merge Sort
  • Insertion Sort
  • Selection sort

• String search algorithms:

  • Brute Force Search
  • Rabin-Karp Algorithm

• Tree Algorithms:

  • Tree balancing

• Graphs Algorithms:

  • Dijkstra algorithm
  • Bellman-Ford's algorithm
  • A* Algorithm
  • Breadth First Search
  • Depth First Search

Installation

pip install --upgrade pip
pip install slav-eeik-datastructures

Modules:

License

This project is licensed under the MIT License - see the LICENSE file for details.

Contacts

For any inquiries, please reach out to the project maintainer on GitHub or Telegram.