<commit_before>..  -*- coding: utf-8 -*-

Release Log
===========


Networkx-1.1
------------

Release date:  Release date:  XX 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
 - Contract strongly 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) betweeness and closeness
 - Improved documentation of drawing, shortest paths, and other algorithms
 - Many more tests
 - and much more, see  https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.1


Examples
~~~~~~~~
 - Mayvi2 drawing http://networkx.lanl.gov/examples/drawing/mayavi2_spring.html
 - Blockmodel http://networkx.lanl.gov/examples/algorithms/blockmodel.html
 - Sampson's monastery http://networkx.lanl.gov/examples/drawing/sampson.html
 - Ego graph http://networkx.lanl.gov/examples/drawing/ego_graph.html

Bug fixes
~~~~~~~~~
 - Support graph attributes with union, intersection, 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 for undirected graphs correctly 
 - add_nodes_from() now accepts (node,attrdict) two-tuples
 - read_gml() now returns multigraphs
<commit_msg>More news for 1.1<commit_after>..  -*- coding: utf-8 -*-

Release Log
===========


Networkx-1.1
------------

Release date:  Release date:  XX 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
 - Contract strongly 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) betweeness and closeness
 - Improved documentation of drawing, shortest paths, and other algorithms
 - Many more tests
 - and much more, see  https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.1

API Changes
-----------
 - pagerank() and hits() now return dictionaries keyed by node
 - add_nodes_from() now accepts (node,attrdict) two-tuples

Examples
~~~~~~~~
 - Mayvi2 drawing http://networkx.lanl.gov/examples/drawing/mayavi2_spring.html
 - Blockmodel http://networkx.lanl.gov/examples/algorithms/blockmodel.html
 - Sampson's monastery http://networkx.lanl.gov/examples/drawing/sampson.html
 - Ego graph http://networkx.lanl.gov/examples/drawing/ego_graph.html

Bug fixes
~~~~~~~~~
 - Support graph attributes with union, intersection, 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

{'fraction_non_alphanumeric': 0.11286951328754852, 'fraction_numerical': 0.0074649148999701405, 'mean_word_length': 3.992548435171386, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 4, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5603239', 'n_tokens_mistral': 982, 'n_tokens_neox': 926, 'n_words': 301}