How to Install and Uninstall python3-pygmtools.noarch Package on Fedora 39
Last updated: January 15,2025
1. Install "python3-pygmtools.noarch" package
This guide covers the steps necessary to install python3-pygmtools.noarch on Fedora 39
$
sudo dnf update
Copied
$
sudo dnf install
python3-pygmtools.noarch
Copied
2. Uninstall "python3-pygmtools.noarch" package
Here is a brief guide to show you how to uninstall python3-pygmtools.noarch on Fedora 39:
$
sudo dnf remove
python3-pygmtools.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the python3-pygmtools.noarch package on Fedora 39
Last metadata expiration check: 3:18:00 ago on Thu Mar 7 17:44:52 2024.
Available Packages
Name : python3-pygmtools
Version : 0.4.0
Release : 1.fc39
Architecture : noarch
Size : 297 k
Source : python-pygmtools-0.4.0-1.fc39.src.rpm
Repository : updates
Summary : A library of Python graph matching solvers
URL : https://pygmtools.readthedocs.io/en/latest/
License : MulanPSL-2.0
Description : pygmtools (Python Graph Matching Tools) provides graph matching
: solvers in Python.
:
: Graph matching is a fundamental yet challenging problem in pattern
: recognition, data mining, and others. Graph matching aims to find
: node-to-node correspondence among multiple graphs, by solving an
: NP-hard combinatorial optimization problem.
:
: Doing graph matching in Python used to be difficult, and this library
: wants to make researchers' lives easier.
Available Packages
Name : python3-pygmtools
Version : 0.4.0
Release : 1.fc39
Architecture : noarch
Size : 297 k
Source : python-pygmtools-0.4.0-1.fc39.src.rpm
Repository : updates
Summary : A library of Python graph matching solvers
URL : https://pygmtools.readthedocs.io/en/latest/
License : MulanPSL-2.0
Description : pygmtools (Python Graph Matching Tools) provides graph matching
: solvers in Python.
:
: Graph matching is a fundamental yet challenging problem in pattern
: recognition, data mining, and others. Graph matching aims to find
: node-to-node correspondence among multiple graphs, by solving an
: NP-hard combinatorial optimization problem.
:
: Doing graph matching in Python used to be difficult, and this library
: wants to make researchers' lives easier.