| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libbtf1.2.1/changelog.Debian.gz |
| FileSize | 2474 |
| MD5 | 8BA88F308E27D7C8E56644E1F9FACB86 |
| SHA-1 | 72ECD750B10A617497404907D0F64DE00DEDEF50 |
| SHA-256 | F3D4D097C70B7B9FE1F382FDE075D19022BAB370CB6389BDA6006D9D3621F787 |
| SSDEEP | 48:XnbZEdfPtOZeggtePwzTWegawPs7q3eonQvEJcxYnjdcT3Dvv+9Y0POGR:3Cjieg+e43WegBPsuO3EJFnjdcbDvm6K |
| TLSH | T1FE514C6034E01E0248A0EEBAB1A15560C02FAF57A8914C8813C7B0DAC81BE32B6544FD |
| hashlookup:parent-total | 2 |
| hashlookup:trust | 60 |
The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 9636 |
| MD5 | 51357BD613FBC3B21517EEF05773405D |
| PackageDescription | permutation to block triangular form library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The BTF library 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libbtf1.2.1 |
| PackageSection | libs |
| PackageVersion | 1:4.4.6-1 |
| SHA-1 | D3666D36BCA5260E22B4A634A0B87C943E5B11FF |
| SHA-256 | C7278BA9DA92E14BFF1EEB5CD9895B8F187A5F9822DA6685C960A82C1E49A234 |
| Key | Value |
|---|---|
| FileSize | 10766 |
| MD5 | 5398DEC5E1801EBABC695749538351AD |
| PackageDescription | permutation to block triangular form library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The BTF library 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libbtf1.2.1 |
| PackageSection | libs |
| PackageVersion | 1:4.4.6-1 |
| SHA-1 | 1634F31BA891676715F6CF54DD605EE8F1503404 |
| SHA-256 | AB531EED77ED41F37853A58A6F5B452CD2FF48AE39F7940298FBF019911B7F1D |