{"name": "amd", "latest": {"version": "0.3.1", "pubspec": {"version": "0.3.1", "description": "A set of routines for ordering a sparse matrix prior to Cholesky factorization.", "dependencies": {"logging": ">=0.9.2 <0.10.0"}, "author": "Richard Lincoln <r.w.lincoln@gmail.com>", "dev_dependencies": {"unittest": ">=0.11.0+3 <0.12.0"}, "homepage": "https://github.com/rwl/amd", "name": "amd"}, "archive_url": "https://mirror.nju.edu.cn/dart-pub/packages/amd/versions/0.3.1.tar.gz", "archive_sha256": "86d82cfcbea73f17be97085759608fdb51a288eb92831bfb8862f969f5cf3836", "published": "2014-12-05T00:38:27.741450Z"}, "versions": [{"version": "0.1.0", "pubspec": {"version": "0.1.0", "name": "amd", "dependencies": {"unittest": ">=0.11.0+3 <0.12.0"}, "author": "Richard Lincoln <r.w.lincoln@gmail.com>", "homepage": "http://www.cise.ufl.edu/research/sparse/amd/", "description": "A set of routines for ordering a sparse matrix prior to Cholesky factorization."}, "archive_url": "https://mirror.nju.edu.cn/dart-pub/packages/amd/versions/0.1.0.tar.gz", "archive_sha256": "1d2dd1e8eae1825151d77256a3477a6277ec5f4684a15ebb5c86d1e704c07b16", "published": "2014-08-02T16:53:07.341060Z"}, {"version": "0.1.1", "pubspec": {"version": "0.1.1", "name": "amd", "dependencies": {"unittest": ">=0.11.0+3 <0.12.0"}, "author": "Richard Lincoln <r.w.lincoln@gmail.com>", "homepage": "http://www.cise.ufl.edu/research/sparse/amd/", "description": "A set of routines for ordering a sparse matrix prior to Cholesky factorization."}, "archive_url": "https://mirror.nju.edu.cn/dart-pub/packages/amd/versions/0.1.1.tar.gz", "archive_sha256": "14fc6f2bbf8c4ee2c69facf1e858a77420ed7dc330c8c72021279ab282d7ba57", "published": "2014-08-03T09:35:12.871320Z"}, {"version": "0.2.1", "pubspec": {"version": "0.2.1", "name": "amd", "dependencies": {"unittest": ">=0.11.0+3 <0.12.0"}, "author": "Richard Lincoln <r.w.lincoln@gmail.com>", "homepage": "http://www.cise.ufl.edu/research/sparse/amd/", "description": "A set of routines for ordering a sparse matrix prior to Cholesky factorization."}, "archive_url": "https://mirror.nju.edu.cn/dart-pub/packages/amd/versions/0.2.1.tar.gz", "archive_sha256": "dfb15c1c3291c3185169e220c0a84e2631bc7ade0f68195cd4785fae6751c621", "published": "2014-08-04T16:56:19.124780Z"}, {"version": "0.3.1", "pubspec": {"version": "0.3.1", "description": "A set of routines for ordering a sparse matrix prior to Cholesky factorization.", "dependencies": {"logging": ">=0.9.2 <0.10.0"}, "author": "Richard Lincoln <r.w.lincoln@gmail.com>", "dev_dependencies": {"unittest": ">=0.11.0+3 <0.12.0"}, "homepage": "https://github.com/rwl/amd", "name": "amd"}, "archive_url": "https://mirror.nju.edu.cn/dart-pub/packages/amd/versions/0.3.1.tar.gz", "archive_sha256": "86d82cfcbea73f17be97085759608fdb51a288eb92831bfb8862f969f5cf3836", "published": "2014-12-05T00:38:27.741450Z"}]}