Basic List Implementation in Python
BLImPy (Basic List Implementation in Python) is a basic implementation of a linked list data structure that is a drop-in replacement for the Python list. It supports all basic list methods. The data structure is not as efficient as the Python list for many operations and in most cases, should not be used except in a teaching setting. It was developed to illustrate basic principles and to be used with GiMPy, a graph implementation in Python. BLImPy includes a stack data structure, a queue data structure, and a priority queue data structure.
Documentation for the API is here:
Release history Release notifications | RSS feed
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size coinor.blimpy-2.0.0-py3-none-any.whl (12.0 kB)||File type Wheel||Python version py3||Upload date||Hashes View|
|Filename, size coinor.blimpy-2.0.0.tar.gz (5.2 kB)||File type Source||Python version None||Upload date||Hashes View|
Hashes for coinor.blimpy-2.0.0-py3-none-any.whl