blob: 28b9164daa74ff49822a0bdf72897af5e8c454c6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
NetworkX News
=============
.. include:: Menu.txt
What's new in NX-0.26?
----------------------
Release date: 6 Jan 2006
New features
~~~~~~~~~~~~
- Simpler interface to drawing with pylab
- G.info(node=None) function returns short information about graph
or node
- adj_matrix now takes optional nodelist to force ordering of
rows/columns in matrix
- optional pygraphviz and pydot interface to graphviz is now callable as
"graphviz" with pygraphviz preferred. Use draw_graphviz(G).
Examples
~~~~~~~~
- Several new examples showing how draw to graphs with various
properties of nodes, edges, and labels
https://networkx.lanl.gov/wiki/file/networkx/trunk/examples/
Bug fixes
~~~~~~~~~
- Default data type for all graphs is now None (was the integer 1)
- add_nodes_from now won't delete edges if nodes added already exist
- Added missing names to generated graphs
- Indexes for nodes in graphs start at zero by default (was 1)
What's new in NX-0.25?
----------------------
Release date: 5 December 2005
New features
~~~~~~~~~~~~
- Uses setuptools for installation http://peak.telecommunity.com/DevCenter/setuptools
- Improved testing infrastructure, can now run python setup.py test
- Added interface to draw graphs with pygraphviz
https://networkx.lanl.gov/pygraphviz/
- is_directed() function call
Examples
~~~~~~~~
- Email example shows how to use XDiGraph with Python objects as
edge data
https://networkx.lanl.gov/wiki/file/networkx/trunk/examples/unixemail.py
Documentation
~~~~~~~~~~~~~
- Reformat menu, minor changes to Readme, better stylesheet
Bug fixes
~~~~~~~~~
- use create_using= instead of result= keywords for graph types
in all cases
- missing weights for degree 0 and 1 nodes in clustering
- configuration model now uses XGraph, returns graph with identical
degree sequence as input sequence
- fixed dijstra priority queue
- fixed non-recursive toposort and is_directed_acyclic graph
What's new in NX-0.24?
----------------------
Release date: 20 August 2005
Bug fixes
~~~~~~~~~
- Update of dijstra algorithm code
- dfs_successor now calls proper search method
- Changed to list compehension in DiGraph.reverse() for python2.3
compatibility
- Barabasi-Albert graph generator fixed
- Attempt to add self loop should add node even if parallel edges not
allowed
What's new in NX-0.23?
----------------------
Release date: 14 July 2005
The NetworkX web locations have changed:
https://networkx.lanl.gov/ - main documentation site
https://networkx.lanl.gov/svn - subversion source code repository
https://networkx.lanl.gov/wiki - bug tracking and info
Important Change
~~~~~~~~~~~~~~~~
The naming conventions in NetworkX have changed.
The package name "NX" is now "networkx".
The suggested ways to import the NetworkX package are
- import networkx
- import networkx as NX
- from networkx import *
New features
~~~~~~~~~~~~
- DiGraph reverse
- Graph generators
+ watts_strogatz_graph now does rewiring method
+ old watts_strogatz_graph->newman_watts_strogatz_graph
Examples
~~~~~~~~
Documentation
~~~~~~~~~~~~~
- Changed to reflect NX-networkx change
- main site is now https://networkx.lanl.gov/
Bug fixes
~~~~~~~~~
- Fixed logic in io.py for reading DiGraphs.
- Path based centrality measures (betweenness, closeness)
modified so they work on graphs that are not connected and
produce the same result as if each connected component were
considered separately.
What's new in NX-0.22?
----------------------
Release date: 17 June 2005
New features
~~~~~~~~~~~~
- Topological sort, testing for directed acyclic graphs (DAGs)
- Dikjstra's algorithm for shortest paths in weighted graphs
- Multidimensional layout with dim=n for drawing
- 3d rendering demonstration with vtk
- Graph generators
+ random_powerlaw_tree
+ dorogovtsev_goltsev_mendes_graph
Examples
~~~~~~~~
- Kevin Bacon movie actor graph: Examples/kevin_bacon.py
- Compute eigenvalues of graph Laplacian: Examples/eigenvalues.py
- Atlas of small graphs: Examples/atlas.py
Documentation
~~~~~~~~~~~~~
- Rewrite of setup scripts to install documentation and
tests in documentation directory specified
Bug fixes
~~~~~~~~~
- Handle calls to edges() with non-node, non-iterable items.
- truncated_tetrahedral_graph was just plain wrong
- Speedup of betweenness_centrality code
- bfs_path_length now returns correct lengths
- Catch error if target of search not in connected component of source
- Code cleanup to label internal functions with _name
- Changed import statement lines to always use "import NX" to
protect name-spaces
- Other minor bug-fixes and testing added
|
