|
1 python-graph |
|
2 A library for working with graphs in Python |
|
3 -------------------------------------------------------------------------------- |
|
4 |
|
5 CHANGELOG |
|
6 |
|
7 |
|
8 Release 1.3.1 [Out 27, 2008] |
|
9 |
|
10 Fixes: |
|
11 Graph and digraph inverse was not working; |
|
12 Node removal in digraphs was not deleting all relevant edges (Issue 13). |
|
13 |
|
14 Important API Changes: |
|
15 Deprecated methods were removed. |
|
16 |
|
17 |
|
18 Release 1.3.0 [Sep 28, 2008] |
|
19 |
|
20 Enhancements: |
|
21 Tree traversals (preorder and postorder). |
|
22 |
|
23 Fixes: |
|
24 Node insertion is much faster now (Issue 11). |
|
25 Hypernode/hyperedge insertion also much faster. |
|
26 |
|
27 Important API Changes: |
|
28 get_nodes() is now nodes(); |
|
29 get_edges() is now edges(); |
|
30 get_neighbors() is now neighbors(); |
|
31 get_incidents() is now incidents(); |
|
32 get_order() is now order(); |
|
33 get_degree() is now degree(). |
|
34 (Former method names are deprecated and will be removed in the next release.) |
|
35 |
|
36 |
|
37 Release 1.2.0 [Sep 09, 2008] |
|
38 |
|
39 Enhancements: |
|
40 Moved to new class style; |
|
41 Graphs and digraphs are separated classes now; |
|
42 Added level-based ordering to breadth first search; |
|
43 Graph object is now iterable; |
|
44 Graph object is now a container and graphobj[nodeid] iterates too; |
|
45 Support for node and edge attributes (Issue 5); |
|
46 Node deletion. |
|
47 |
|
48 Fixes: |
|
49 Install now works with a prefix (Issue 10); |
|
50 Shortest path spanning trees did not had an explicit root. |
|
51 |
|
52 Important API Changes: |
|
53 breadth_first_search() now returns a tuple; |
|
54 Arrow methods are gone. Use class digraph + edge methods for directed graphs now. |
|
55 |
|
56 |
|
57 Release 1.1.1 [Sep 04, 2008] |
|
58 |
|
59 Enhancements: |
|
60 Improved install script. |
|
61 |
|
62 Fixes: |
|
63 DOT Language output now works for nodes/edges labelled with spaces. |
|
64 |
|
65 Important API Changes: |
|
66 get_neighbours() is now get_neighbors() (Issue 9). |
|
67 |
|
68 |
|
69 Release 1.1.0 [Aug 31, 2008] |
|
70 |
|
71 Enhancements: |
|
72 Hypergraph support (Issue 4); |
|
73 Complete and complement graph generation; |
|
74 Weights in random generated graphs (Issue 8). |
|
75 |
|
76 Fixes: |
|
77 Fixed bug in cut-node identification; |
|
78 Fixed bug causing wrong results for graphs with nodes labelled with values that evaluate to False (Issue 7). |
|
79 |
|
80 Important API Changes: |
|
81 get_edges() now return all edges in the graph; |
|
82 get_neighbours() has the former behaviour of get_edges(). |
|
83 |
|
84 |
|
85 Release 1.0.0 [Aug 01, 2008] |
|
86 |
|
87 Adds some operations; |
|
88 Random graph generation; |
|
89 Cut-vertex/cut-edge identification. |
|
90 |
|
91 |
|
92 Release 0.85 [Jul 27, 2008] |
|
93 |
|
94 Adds DOT-Language output (Issue 1); |
|
95 Install script included (Issue 3). |
|
96 |
|
97 |
|
98 Release 0.75 [Jul 06, 2008] |
|
99 |
|
100 Added XML import/export; |
|
101 Docs are bundled now. |
|
102 |
|
103 |
|
104 Release 0.65 [Jun 25, 2008] |
|
105 |
|
106 DFS, BFS and MST can be generated for given roots; |
|
107 Added Dijkstra's shortest path algorithm (Issue 2). |
|
108 |
|
109 |
|
110 Release 0.50 [May 13, 2008] |
|
111 |
|
112 Some API changes; |
|
113 Nodes can now be arbitrary names/objects. |
|
114 |
|
115 |
|
116 Release 0.45 [May 12, 2008] |
|
117 |
|
118 Adds Prim's minimal spanning tree. |
|
119 |
|
120 |
|
121 Release 0.40 [Mar 09, 2008] |
|
122 |
|
123 Adds topological sorting; |
|
124 Support for weighted graphs. |
|
125 |
|
126 |
|
127 Release 0.30 [Aug 30, 2007] |
|
128 |
|
129 Adds algorithms for accessibility and mutual accessibility. |
|
130 |
|
131 Release 0.20 [Jul 16, 2007] |
|
132 |
|
133 Adds breadth-first search; |
|
134 API documentation. |
|
135 |
|
136 |
|
137 Release 0.10 [Jul 10, 2007] |
|
138 |
|
139 First release; |
|
140 Feat. basic operations and depth-first searching. |