How to Install and Uninstall python312-HeapDict Package on openSuSE Tumbleweed
Last updated: December 25,2024
1. Install "python312-HeapDict" package
Please follow the steps below to install python312-HeapDict on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
python312-HeapDict
Copied
2. Uninstall "python312-HeapDict" package
Please follow the guidelines below to uninstall python312-HeapDict on openSuSE Tumbleweed:
$
sudo zypper remove
python312-HeapDict
Copied
3. Information about the python312-HeapDict package on openSuSE Tumbleweed
Information for package python312-HeapDict:
-------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python312-HeapDict
Version : 1.0.1-3.4
Arch : noarch
Vendor : openSUSE
Installed Size : 14.9 KiB
Installed : No
Status : not installed
Source package : python-HeapDict-1.0.1-3.4.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 : openSUSE-Tumbleweed-Oss
Name : python312-HeapDict
Version : 1.0.1-3.4
Arch : noarch
Vendor : openSUSE
Installed Size : 14.9 KiB
Installed : No
Status : not installed
Source package : python-HeapDict-1.0.1-3.4.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*.