Jellybeans aims to provide an easier development process when working with various data structures in python. Visualisations are provided for sorting algortihms.
- Ensure that you have python 3.7 and above
- Run the following command: pip install jellybeans
Below are the data structures and algorithms that are covered in this library.
- AVL Tree
- Binary Heap
- Graph
- Singly Linked List
- Tailed Linked List
- Doubly Linked List
- Queue
- Deque
- Stack
- Union Find Disjoint Sets (UFDS)
- Bubble Sort
- Bubble Sort Optimised
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Reachability
- Number of components
- Topological sort
- Strongly Connected components (SCCs)
- Minimum spanning tree (Prims, Prims-Dense, Kruskal's)
- Single Source Shortest Path (Bellman Ford, One-pass BF, Dijkstra's)
- All Pairs Shortest Path (Floyd Warshall)
I would also like to mention that majority of the knowledge used to develop this library came from the undertaking of National University of Singapore's course CS2040.
Anyone who wishes to value add to this library is welcomed to do so. Check out the Contribution Guide for further information on how you can contribute!