Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: libbtf2 | Distribution: Mageia |
Version: 7.11.0 | Vendor: Mageia.Org |
Release: 1.mga10 | Build date: Sun Oct 12 14:52:53 2025 |
Group: Development/C | Build host: localhost |
Size: 52684 | Source RPM: suitesparse-7.11.0-1.mga10.src.rpm |
Packager: aurr <aurr> | |
Url: https://faculty.cse.tamu.edu/davis/suitesparse.html | |
Summary: Routines for permuting sparse matrices to block triangular form |
BTF is a software package for permuting a matrix into block upper triangular form. It includes a maximum transversal algorithm, which finds a permutation of a square or rectangular matrix so that it has a zero-free diagonal (if one exists); otherwise, it finds a maximal matching which maximizes the number of nonzeros on the diagonal. The package also includes a method for finding the strongly connected components of a graph. These two methods together give the permutation to block upper triangular form.
(LGPLv2+ or BSD) and LGPLv2+ and GPLv2+
* Sun Oct 12 2025 aurr <aurr> 7.11.0-1.mga10 + Revision: 2277590 - new version: 7.11.0 - switch to direct cmake build - add support for 64-bit integer interface * Sat Jun 28 2025 umeabot <umeabot> 5.13.0-3.mga10 + Revision: 2217468 - Mageia 10 Mass Rebuild
/usr/lib/.build-id /usr/lib/.build-id/04 /usr/lib/.build-id/04/a03c1017a04dc812a4584d5582caf7bb151acf /usr/lib/libbtf.so.2 /usr/lib/libbtf.so.2.3.3 /usr/share/doc/libbtf2 /usr/share/doc/libbtf2/ChangeLog /usr/share/doc/libbtf2/README.txt /usr/share/licenses/libbtf2 /usr/share/licenses/libbtf2/License.txt /usr/share/licenses/libbtf2/lesser.txt
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Oct 14 08:46:29 2025