522bc1b543
Release Log Networkx-1.7 Release date: 4 July 2012 Highlights New functions for k-clique community finding, flow hierarchy, union, disjoint union, compose, and intersection operators that work on lists of graphs, and creating the biadjacency matrix of a bipartite graph. New approximation algorithms for dominating set, edge dominating set, independent set, max clique, and min-weighted vertex cover. Many bug fixes and other improvements. For full details of the tickets closed for this release (added features and bug fixes) see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.7 API Changes See Version 1.7 notes and API changes
5 lines
239 B
Text
5 lines
239 B
Text
$NetBSD: distinfo,v 1.5 2012/07/13 14:00:32 wen Exp $
|
|
|
|
SHA1 (networkx-1.7.tar.gz) = 1a83dbbac6fb4abc6bfd644ae3c4a6af8ebb1c33
|
|
RMD160 (networkx-1.7.tar.gz) = 90c35abf42a0ec68b3ece14cac02f4b47b6c0a20
|
|
Size (networkx-1.7.tar.gz) = 728145 bytes
|