maryamashoori/pythonAlgorithms

Python implementations of common computer science data structures & algorithms

PythonAlgorithms

Python implementations of common computer science data structures & algorithms.

Data Structures

• Linked List

    - insertion
    - printing the list
    - Removing duplicates
  

• Binary Search Tree

    - insertion
    - traversal (inorder, preorder, postorder)
    - calculate height of the tree
    - search an element in the tree
    - delete a node from the tree
    - find the min element in the tree
  

• Queue

    - enqueue
    - print
    - return the front of the queue
    - dequeue
    - check if the queue is empty
  

• Max Heap

    - max heapify
    - heapsort
  

• Priority Queue

    - return the max element
    - remove the max element from the queue
    - increase key
    - insert an element to the queue
  

• Directed Graph

    - add edges to the graph
    - breath first search
  

• Weighted Directed Graph

    - add edges to the graph
    - breath first search
    - Dijkstra’s shortest path algorithm
  

Sorting Algorithms

• Insertion Sort
• Merge Sort
• Heap Sort
• Quicksort and Randomized Quicksort
• Counting Sort

Traversal

• Breadth First Search
• Dijkstra's shortest path algorithm

Wishlist

• Splay Trees
• Kruskal's Algorithm
• A* Search
• Alpha-Beta Pruning
• Bellman-Ford
• Floyd-Warshall
• Maze Generation
• Red-Black Tree
• Priority Queue
• Trie
• Union Find
• Graph
• Depth First Search
• Prim's Minimum Spanning Tree
• Fisher-Yates
• Boyer-Moore
• Knuth-Morris-Pratt

License

This project uses the Apache License Version 2.0 software license.