How to Install and Uninstall python3-HeapDict Package on openSUSE Leap
Last updated: February 24,2025
1. Install "python3-HeapDict" package
Learn how to install python3-HeapDict on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
python3-HeapDict
Copied
2. Uninstall "python3-HeapDict" package
Here is a brief guide to show you how to uninstall python3-HeapDict on openSUSE Leap:
$
sudo zypper remove
python3-HeapDict
Copied
3. Information about the python3-HeapDict package on openSUSE Leap
Information for package python3-HeapDict:
-----------------------------------------
Repository : Main Repository
Name : python3-HeapDict
Version : 1.0.1-bp155.2.11
Arch : noarch
Vendor : openSUSE
Installed Size : 14.4 KiB
Installed : No
Status : not installed
Source package : python-HeapDict-1.0.1-bp155.2.11.src
Upstream URL : http://stutzbachenterprises.com/
Summary : A heap with decrease-key and increase-key operations
Description :
HeapDict implements the MutableMapping ABC, meaning it works pretty
much like a regular Python dict. It's designed to be used as a
priority queue.
Unlike the Python standard library's heapq module, the HeapDict
supports efficiently changing the priority of an existing object
(often called "decrease-key" in textbooks). Altering the priority is
important for many algorithms such as Dijkstra's Algorithm and A*.
-----------------------------------------
Repository : Main Repository
Name : python3-HeapDict
Version : 1.0.1-bp155.2.11
Arch : noarch
Vendor : openSUSE
Installed Size : 14.4 KiB
Installed : No
Status : not installed
Source package : python-HeapDict-1.0.1-bp155.2.11.src
Upstream URL : http://stutzbachenterprises.com/
Summary : A heap with decrease-key and increase-key operations
Description :
HeapDict implements the MutableMapping ABC, meaning it works pretty
much like a regular Python dict. It's designed to be used as a
priority queue.
Unlike the Python standard library's heapq module, the HeapDict
supports efficiently changing the priority of an existing object
(often called "decrease-key" in textbooks). Altering the priority is
important for many algorithms such as Dijkstra's Algorithm and A*.