How to Install and Uninstall nauty Package on openSuSE Tumbleweed
Last updated: December 26,2024
1. Install "nauty" package
Please follow the guidelines below to install nauty on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
nauty
Copied
2. Uninstall "nauty" package
This tutorial shows how to uninstall nauty on openSuSE Tumbleweed:
$
sudo zypper remove
nauty
Copied
3. Information about the nauty package on openSuSE Tumbleweed
Information for package nauty:
------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : nauty
Version : 2.8.8-1.2
Arch : x86_64
Vendor : openSUSE
Installed Size : 2.6 MiB
Installed : No
Status : not installed
Source package : nauty-2.8.8-1.2.src
Upstream URL : https://pallini.di.uniroma1.it/
Summary : Tools for computing automorphism groups of graphs
Description :
nauty and Traces are programs for computing automorphism groups of
graphs and digraphs (*Traces does not accept digraphs at this time).
They can also produce a canonical label. They are written in a
portable subset of C, and run on a considerable number of different
systems.
There is a small suite of programs called gtools included in the
package. For example, geng can generate non-isomorphic graphs very
quickly. There are also generators for bipartite graphs, digraphs,
and multigraphs.
------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : nauty
Version : 2.8.8-1.2
Arch : x86_64
Vendor : openSUSE
Installed Size : 2.6 MiB
Installed : No
Status : not installed
Source package : nauty-2.8.8-1.2.src
Upstream URL : https://pallini.di.uniroma1.it/
Summary : Tools for computing automorphism groups of graphs
Description :
nauty and Traces are programs for computing automorphism groups of
graphs and digraphs (*Traces does not accept digraphs at this time).
They can also produce a canonical label. They are written in a
portable subset of C, and run on a considerable number of different
systems.
There is a small suite of programs called gtools included in the
package. For example, geng can generate non-isomorphic graphs very
quickly. There are also generators for bipartite graphs, digraphs,
and multigraphs.