Parents (Total: 4)
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
| Key |
Value |
| MD5 | 5DB12C5FCCF3FDE6C55FAA1D2A39E6FF |
| 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 | ghibo <ghibo> |
| PackageName | libbtf4 |
| PackageRelease | 1.mga9 |
| PackageVersion | 5.13.0 |
| SHA-1 | B83C9298F33FD1E4C5DA9092D1A363AD254BB406 |
| SHA-256 | 00E99911FF4E8F11A220AF8EB556943975E9F31BC8011A49C38357B4C2A0A9B0 |
| 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 | 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 | 8699C1751BB9ABA4F6AFE95EF3E2483C |
| 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 | joequant <joequant> |
| PackageName | libbtf4 |
| PackageRelease | 2.mga9 |
| PackageVersion | 5.12.0 |
| SHA-1 | 983BC9B7C01A7D304E5E18FEBE426673AF771901 |
| SHA-256 | BDAD713098E6887667EA807B3D458DFD2E30EE158726EB6E2657BA4AE9A6BFF2 |