[no description] https://git.osdyson.ru/mirror/pkgsrc/atom?h=pkgsrc-2014Q2 2014-06-10T12:04:58Z 2014-06-10T12:04:58Z wen wen@pkgsrc.org 2014-06-10T12:04:58Z urn:sha1:61c5b0b77faaf2b223541bd19509c44aa7603886 Upstream changes: Networkx-1.8.1 Release date: 4 August 2013 Bugfix release for missing files in source packaging Networkx-1.8 Release date: 28 July 2013 Highlights Faster (linear-time) graphicality tests and Havel-Hakimi graph generators Directed Laplacian matrix generator Katz centrality algorithm Functions to generate all simple paths Improved shapefile reader More flexible weighted projection of bipartite graphs Faster topological sort, decendents and ancestors of DAGs Scaling parameter for force-directed layout Bug Fixes Error with average weighted connectivity for digraphs, correct normalized laplacian with self-loops, load betweenness for single node graphs, isolated nodes missing from dfs/bfs trees, normalize HITS using l1, handle density of graphs with self loops Cleaner handling of current figure status with Matplotlib, Pajek files now don't write troublesome header line, default alpha value for GEXF files, read curved edges from yEd GraphML 2014-05-09T07:36:53Z wiz wiz@pkgsrc.org 2014-05-09T07:36:53Z urn:sha1:6110b3907a630ba5f56311a5b07f346b35648583 until proven otherwise. 2014-01-25T10:29:56Z wiz wiz@pkgsrc.org 2014-01-25T10:29:56Z urn:sha1:4fc0b0ed6a186ccd83fc93c34cc9ed91862930d8 either because they themselves are not ready or because a dependency isn't. This is annotated by PYTHON_VERSIONS_INCOMPATIBLE= 33 # not yet ported as of x.y.z or PYTHON_VERSIONS_INCOMPATIBLE= 33 # py-foo, py-bar respectively, please use the same style for other packages, and check during updates. Use versioned_dependencies.mk where applicable. Use REPLACE_PYTHON instead of handcoded alternatives, where applicable. Reorder Makefile sections into standard order, where applicable. Remove PYTHON_VERSIONS_INCLUDE_3X lines since that will be default with the next commit. Whitespace cleanups and other nits corrected, where necessary. 2012-10-04T00:21:58Z cheusov cheusov@pkgsrc.org 2012-10-04T00:21:58Z urn:sha1:fb1ffebcad8333fcea943204be2622ce741149e0 2012-10-03T23:40:35Z cheusov cheusov@pkgsrc.org 2012-10-03T23:40:35Z urn:sha1:2144a22c157ca35b7a75a962a671a9c4d019bd76 2012-10-03T22:14:00Z wiz wiz@pkgsrc.org 2012-10-03T22:14:00Z urn:sha1:6881df6a4c0580c6f1e791e8700778ea489dd113 2012-09-11T23:04:15Z asau asau@pkgsrc.org 2012-09-11T23:04:15Z urn:sha1:b0feb9f5b186a62a131121fe59db9ccdc0a844bd 2012-07-13T14:00:32Z wen wen@pkgsrc.org 2012-07-13T14:00:32Z urn:sha1:642c4fc4aac8f10c58851bf181034c889a4485ee 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 2012-06-02T13:19:17Z obache obache@pkgsrc.org 2012-06-02T13:19:17Z urn:sha1:8039ec81d4399032bd13abe68e91aa9be3159479 Based on PR 46506 by Wen Heping. * let to register egg-info. * marked as incompatible with python 2.5, as new features in 1.3. but not marked as compatible with 3.x, one file will not be compiled well both 3.1 and 3.2. Lease Log: Networkx-1.6 Release date: 20 November 2011 Highlights New functions for finding articulation points, generating random bipartite graphs, constructing adjacency matrix representations, forming graph products, computing assortativity coefficients, measuring subgraph centrality and communicability, finding k-clique communities, and writing JSON format output. New examples for drawing with D3 Javascript library, and ordering matrices with the Cuthill-McKee algorithm. More memory efficient implementation of current-flow betweenness and new approximation algorithms for current-flow betweenness and shortest-path betweenness. Simplified handling of "weight" attributes for algorithms that use weights/costs/values. See Version 1.6 notes and API changes. Updated all code to work with the PyPy Python implementation http://pypy.org which produces faster performance on many algorithms. 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.6 API Changes See Version 1.6 notes and API changes: http://networkx.lanl.gov/reference/api_1.6.html Networkx-1.5 Release date: 4 June 2011 For full details of the tickets closed for this release see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.5 Highlights New features * Algorithms for generating and analyzing bipartite graphs * Maximal independent set algorithm * Erd?s-Gallai graphical degree sequence test * Negative edge cycle test * More memory efficient Dijkstra path length with cutoff parameter * Weighted clustering coefficient * Read and write version 1.2 of GEXF reader format * Neighbor degree correlation that handle subsets of nodes * In-place node relabeling * Many `weighted' graph algorithms now take optional parameter to use specified edge attribute (default=`weight') (ticket 509) * Test for distance regular graphs * Fast directed Erd?s-Renyi graph generator * Fast expected degree graph generator * Navigable small world generator * Waxman model generator * Geographical threshold graph generator * Karate Club, Florentine Families, and Davis' Women's Club graphs API Changes See Version 1.5 notes and API changes http://networkx.lanl.gov/reference/api_1.5.html Bug fixes * Fix edge handling for multigraphs in networkx/graphviz interface (ticket 507) * Update networkx/pydot interface for new versions of pydot (ticket 506), (ticket 535) * Fix negative cycle handling in Bellman-Ford (ticket 502) * Write more attributes with GraphML and GML formats (ticket 480) * Handle white space better in read_edgelist (ticket 513) * Better parsing of Pajek format files (ticket 524) (ticket 542) * Isolates functions work with directed graphs (ticket 526) * Faster conversion to numpy matrices (ticket 529) * Add graph[`name'] and use properties to access Graph.name (ticket 544) * Topological sort confused None and 0 (ticket 546) * GEXF writer mishandled weight=0 (ticket 550) * Speedup in SciPy version of PageRank (ticket 554) * Numpy PageRank node order incorrect + speedups (ticket 555) Networkx-1.4 Release date: 23 January 2011 New features * k-shell,k-crust,k-corona * read GraphML files from yEd * read/write GEXF format files * find cycles in a directed graph * DFS and BFS algorithms * chordal graph functions * Prim's algorithm for minimum spanning tree * r-ary tree generator * rich club coefficient * NumPy matrix version of Floyd's algorithm for all-pairs shortest path * read GIS shapefiles * functions to get and set node and edge attributes * and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.4 API Changes * gnp_random_graph() now takes a directed=True|False keyword instead of create_using * gnm_random_graph() now takes a directed=True|False keyword instead of create_using Bug fixes * see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.4 Networkx-1.3 Release date: 28 August 2010 See: https://networkx.lanl.gov/trac/timeline New features * Works with Python versions 2.6, 2.7, 3.1, and 3.2 (but not 2.4 and 2.5). * Minimum cost flow algorithms * Bellman-Ford shortest paths * GraphML reader and writer * More exception/error types * Updated many tests to unittest style. Run with: "import networkx; networkx.test()" (requires nose testing package) * and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.3 API Changes * minimum_spanning_tree() now returns a NetworkX Graph (a tree or forest) Bug fixes * see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.3 2010-08-27T03:09:18Z gls gls@pkgsrc.org 2010-08-27T03:09:18Z urn:sha1:3050f7c16aa0d9167d1aaa491d0dd72b0dc9d0ff From PR pkg/43790 by Kamel Derouiche pkgsrc changes: - re-set LICENSE (modified-bsd). upstream changes: Networkx-1.2 Release date: 28 July 2010 See: https://networkx.lanl.gov/trac/timeline New features * Ford-Fulkerson max flow and min cut * Closness vitality * Eulerian circuits * Functions for isolates * Simpler s_max generator * Compatible with IronPython-2.6 * Improved testing functionality: import networkx; networkx.test() tests entire package and skips tests with missing optional packages * All tests work with Python-2.4 * and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.2 Networkx-1.1 Release date: 21 April 2010 See: https://networkx.lanl.gov/trac/timeline New features * Algorithm for finding a basis for graph cycles * Blockmodeling * Assortativity and mixing matrices * in-degree and out-degree centrality * Attracting components and condensation. * Weakly connected components * Simpler interface to shortest path algorithms * Edgelist format to read and write data with attributes * Attribute matrices * GML reader for nested attributes * Current-flow (random walk) betweenness and closeness. * Directed configuration model, and directed random graph model. * Improved documentation of drawing, shortest paths, and other algorithms * Many more tests, can be run with ?import networkx; networkx.test()? * and much more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.1 API Changes Returning dictionaries Several of the algorithms and the degree() method now return dictionaries keyed by node instead of lists. In some cases there was a with_labels keyword which is no longer necessary. For example, >>> G=nx.Graph() >>> G.add_edge('a','b') >>> G.degree() # returns dictionary of degree keyed by node {'a': 1, 'b': 1} Asking for the degree of a single node still returns a single number >>> G.degree('a') 1 The following now return dictionaries by default (instead of lists) and the with_labels keyword has been removed: * Graph.degree(), MultiGraph.degree(), DiGraph.degree(), DiGraph.in_degree(), DiGraph.out_degree(), MultiDiGraph.degree(), MultiDiGraph.in_degree(), MultiDiGraph.out_degree(). * clustering(), triangles() * node_clique_number(), number_of_cliques(), cliques_containing_node() * eccentricity() The following now return dictionaries by default (instead of lists) * pagerank() * hits() Adding nodes add_nodes_from now accepts (node,attrdict) two-tuples >>> G=nx.Graph() >>> G.add_nodes_from([(1,{'color':'red'})]) Examples * Mayvi2 drawing * Blockmodel * Sampson?s monastery * Ego graph Bug fixes * Support graph attributes with union, intersection, and other graph operations * Improve subgraph speed (and related algorithms such as connected_components_subgraphs()) * Handle multigraphs in more operators (e.g. union) * Handle double-quoted labels with pydot * Normalize betweeness_centrality for undirected graphs correctly * Normalize eigenvector_centrality by l2 norm * read_gml() now returns multigraphs