Parents (Total: 16)
The searched file hash is included in 16 parent files which include package known and seen by metalookup. A sample is included below:
Key |
Value |
MD5 | 18DE5DE3985486036A9D67B980A75813 |
PackageArch | aarch64 |
PackageDescription | 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. |
PackageMaintainer | ghibo <ghibo> |
PackageName | lib64btf4 |
PackageRelease | 1.mga9 |
PackageVersion | 5.13.0 |
SHA-1 | 0011D22DFBDAF849C6477A9D75BCCDADAFE5B850 |
SHA-256 | EED6F9129AB4F1D4CF7BA44DAA2FF58CAF2B3597ECF3BB2C880C210F4195CB01 |
Key |
Value |
MD5 | 0C36C146FB8441758B0A7AE45E4F27D8 |
PackageArch | i586 |
PackageDescription | The suitesparse-devel package contains files needed for developing
applications which use the suitesparse libraries. |
PackageMaintainer | joequant <joequant> |
PackageName | suitesparse-devel |
PackageRelease | 2.mga9 |
PackageVersion | 5.12.0 |
SHA-1 | 0A2FB0994026F2E399F9E6F59672E32FAD6F9B91 |
SHA-256 | 9DDFAFD3FFB538F0D72FFCBE057A2E90963307FFBA1B0F34C68EC954388AD5B1 |
Key |
Value |
MD5 | 3BDDA8A6929613788DE6A60B03F4C7D8 |
PackageArch | x86_64 |
PackageDescription | The suitesparse-devel package contains files needed for developing
applications which use the suitesparse libraries. |
PackageMaintainer | ghibo <ghibo> |
PackageName | suitesparse-devel |
PackageRelease | 1.mga9 |
PackageVersion | 5.13.0 |
SHA-1 | 232E02E1635D1497097CD0468CC63E305A9026FC |
SHA-256 | 94CAD3F386B10F6A81EC5A9DB69BA9EF3547E9C18C9689FED5A0BDD81B544E70 |
Key |
Value |
MD5 | 287E2A1972CE871DC7458F634DDC5179 |
PackageArch | aarch64 |
PackageDescription | The suitesparse-devel package contains files needed for developing
applications which use the suitesparse libraries. |
PackageMaintainer | ghibo <ghibo> |
PackageName | suitesparse-devel |
PackageRelease | 1.mga9 |
PackageVersion | 5.13.0 |
SHA-1 | 3824E5673C89BA280CBEE7EC8FEE36F10E32A55D |
SHA-256 | 2B6DC496CC2124970E81C38A6BEECBEC01617C643E3072E4ECDCD20D81A29B1E |
Key |
Value |
MD5 | 3FC1FC5647558928C826FC2FB21276AA |
PackageArch | aarch64 |
PackageDescription | The suitesparse-devel package contains files needed for developing
applications which use the suitesparse libraries. |
PackageMaintainer | joequant <joequant> |
PackageName | suitesparse-devel |
PackageRelease | 2.mga9 |
PackageVersion | 5.12.0 |
SHA-1 | 45E05F93F573E04FD1E0F38848F50CEADBC3433B |
SHA-256 | 4BD5055044B7C69B228201B5AC66F56639F0EC778415BEFA4A93D00E0BBE3A4A |
Key |
Value |
MD5 | CF53B1C017A3693886D84F983B2C4629 |
PackageArch | armv7hl |
PackageDescription | 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. |
PackageMaintainer | joequant <joequant> |
PackageName | libbtf4 |
PackageRelease | 2.mga9 |
PackageVersion | 5.12.0 |
SHA-1 | 4FB6AAC18093F536970D0EC090C66444A95C7B3D |
SHA-256 | 89E61A06FBA90C248B0057064E00E49A2E3A809FD94362701DFF1AFD9501642F |
Key |
Value |
MD5 | 434267C2C3DB612AE9114ABA62D022BB |
PackageArch | armv7hl |
PackageDescription | The suitesparse-devel package contains files needed for developing
applications which use the suitesparse libraries. |
PackageMaintainer | ghibo <ghibo> |
PackageName | suitesparse-devel |
PackageRelease | 1.mga9 |
PackageVersion | 5.13.0 |
SHA-1 | 52465F531DCF2645F3685A802632FB5BC90F5607 |
SHA-256 | 2D9E2BE3996A0F4C63FEDFE2C88F4A51C290D04E1A2A4648A0FBCD5DB2D6A68D |
Key |
Value |
MD5 | D4AB0946C3F147D0F2916182B336AF14 |
PackageArch | x86_64 |
PackageDescription | 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. |
PackageMaintainer | joequant <joequant> |
PackageName | lib64btf4 |
PackageRelease | 2.mga9 |
PackageVersion | 5.12.0 |
SHA-1 | 638CDBFA7204B40DF7AE4104C4B5FB040BB5F769 |
SHA-256 | 0DDEC979150E2C43270B80AAF730FDBD8D37E2083CF61920F303747935A46039 |
Key |
Value |
MD5 | D16EFBD8D0D995FB383BA00E843ADD4E |
PackageArch | i586 |
PackageDescription | 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. |
PackageMaintainer | ghibo <ghibo> |
PackageName | libbtf4 |
PackageRelease | 1.mga9 |
PackageVersion | 5.13.0 |
SHA-1 | 734274C896BF54751E9640370FC200664DCA5D65 |
SHA-256 | CFCC031783D033E05C9FC2D38C4B8C3A91A3EA9E8939BD143762755C5AF61E93 |
Key |
Value |
MD5 | 1FE9415E31C5527F519D42AC102434F8 |
PackageArch | aarch64 |
PackageDescription | 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. |
PackageMaintainer | joequant <joequant> |
PackageName | lib64btf4 |
PackageRelease | 2.mga9 |
PackageVersion | 5.12.0 |
SHA-1 | 89B778FFBB949A1CD1049831835B4276B168B0F8 |
SHA-256 | 037A016A794A2914FA32A2C3FB0866B4DCE90014DC5ED0C3AE2DA2BD2570B65D |