Key | Value |
---|---|
FileName | ./usr/share/lintian/overrides/libbtf1 |
FileSize | 92 |
MD5 | 552DD1A97A1E12E62FEDACE603A5B27A |
SHA-1 | 29271482C69487347F4FE00AFE4E48AA78425589 |
SHA-256 | 8C6AF4D98DF7A6973F13CE7296B950AA8B3EADAA15BE3623CB3251B8C6524263 |
SHA-512 | FC4F17117871226CD79CD6C79B9084821A822E38F0F758EB4829A61C523E5FBAAD3C0ED297E3AB9AD0A4F4E61FD7C489943D02C6BDD5F0AE5DCCEEDDF26EA191 |
SSDEEP | 3:S/QjpGlU0PRIBAVA17KGMKLFQfEC/L+:Sfy0PNAFMKBC+ |
TLSH | T10CB012A0D248663C713963CB3055F06024644854084145574450608C8144D93130AC93 |
insert-timestamp | 1728237172.1226192 |
mimetype | text/plain |
source | snap:LJzR5xevdtU54wLeciVWXdhlKy1L4TrX_3 |
hashlookup:parent-total | 12 |
hashlookup:trust | 100 |
The searched file hash is included in 12 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 23744 |
MD5 | CBDDA336E045F4E9C698D6F15AC2A440 |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 9A55B90B2A134E8E9889889236C509A980B95523 |
SHA-256 | 30765CB31E90EE4505D727492EA97EA960F678A25938FAA72DDD26805FD1B5F7 |
Key | Value |
---|---|
FileSize | 11852 |
MD5 | 0E76311C42B90471EFE494B4689E4590 |
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 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 4B64D665F80F5F10CE4FA086234E6F5DD2ABE585 |
SHA-256 | 00CA7CAA77F8AF755085537E8CF565BD49C89BDF07C2617B57E7D870C41DA583 |
Key | Value |
---|---|
SHA-1 | 0844DA217E72796226B9BB33AFA548B945A5701B |
snap-authority | canonical |
snap-filename | LJzR5xevdtU54wLeciVWXdhlKy1L4TrX_3.snap |
snap-id | LJzR5xevdtU54wLeciVWXdhlKy1L4TrX_3 |
snap-name | turtlebot3c-nav |
snap-publisher-id | canonical-robotics |
snap-signkey | BWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul |
snap-timestamp | 2024-02-29T15:21:40.977803Z |
source-url | https://api.snapcraft.io/api/v1/snaps/download/LJzR5xevdtU54wLeciVWXdhlKy1L4TrX_3.snap |
Key | Value |
---|---|
FileSize | 23132 |
MD5 | 2377D86A3B74A511A95FE5DEF4A53B9A |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | A6EE7CF7872ED11497460E0071C75D86A80A7CC9 |
SHA-256 | 487514DA2428AE34A3FC8036817084596A88FD204D212DCFDEA57519EB15959D |
Key | Value |
---|---|
FileSize | 26556 |
MD5 | 77AC7070E3C87387A810075190D7C51C |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | D97C762F6B6FCDB35B1981C9D17A5EED11DFDE28 |
SHA-256 | F61428266920D90CDE198BC283C0A13D6E35DF56F9C893D86C64BEC6BADCCDF3 |
Key | Value |
---|---|
FileSize | 23620 |
MD5 | 08DF1B6D86280CD29F446A362D74091E |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 1FC75728DBA68DB4567C2FEDAD08885C84E8C85E |
SHA-256 | 98A8C1AE9845C7BC5FCAAFC8A33113499E64813C5D3C5165A29A484A43488B28 |
Key | Value |
---|---|
FileSize | 24956 |
MD5 | 59EB2840DE49FDC7515A76CCD7FD2CD2 |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | E67809C83E23995C17882797E8650BA9B2772050 |
SHA-256 | 8CE59CAF02B78E69672F503B0F626BF60CDBD0A986399C5DB95CAF6C78D3A7E1 |
Key | Value |
---|---|
FileSize | 24848 |
MD5 | 088D1A98F60B5C53DDA8E762EB8A0C5B |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | CFFACBEE61BAFEE6434CB54BCB1837B350E2E269 |
SHA-256 | A2ED189DAA4DB390F244FEF1F98CC11F7A377715EA3F4E063DD4E84D3C0E923B |
Key | Value |
---|---|
FileSize | 24376 |
MD5 | E85F819C05D0FC1AC98DD5DF9FB59814 |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 9BBDF23511453241072832FD9D6B48E6E355F31F |
SHA-256 | 25EAAFA2BF7D8AA5B933337DA18257A979CC226D26F72E7E238FDDF50C45AF93 |
Key | Value |
---|---|
FileSize | 24352 |
MD5 | 710FA7FB50DA869DDC5313E14702C260 |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | E77C23EEB5FEEBB5A384B7F837E1524BAFC74012 |
SHA-256 | CEADCE3D5AA815E5D38BCD2A24CFDB98A6D9D9A537E1226E90828721F4681338 |
Key | Value |
---|---|
FileSize | 11288 |
MD5 | 7CFC763CC46550381EAAE33B86F56CC8 |
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 |
PackageSection | libs |
PackageVersion | 1:5.7.1+dfsg-2 |
SHA-1 | 1E66A1E75E89DDC38E4F07C58E8DDA49EF5BB73E |
SHA-256 | E8A6B4730AAF09BE3221B69FB494E6EDBC5F5B8221104D0D8775B1E57F726153 |
Key | Value |
---|---|
FileSize | 24908 |
MD5 | BDFED6F21D76C28BB089C5D6EEA9465A |
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 | Debian Science Team <debian-science-maintainers@lists.alioth.debian.org> |
PackageName | libbtf1 |
PackageSection | libs |
PackageVersion | 1:5.8.1+dfsg-2 |
SHA-1 | 24105CA642CC2575805A1AEED8AECE518CA125B8 |
SHA-256 | B1FB3DFFCBA5D76634B82DFC80D495A90BEEEB855296CC337E467A1DCAD25A59 |