Modified:
/wiki/Changelog.wiki
=======================================
--- /wiki/Changelog.wiki Sat Oct 2 08:43:38 2010
+++ /wiki/Changelog.wiki Sun Jan 8 11:13:39 2012
@@ -1,6 +1,21 @@
#summary python-graph most important changes across releases.
#labels Featured
+===Release 1.8.1===
+Jan 08, 2012
+
+*Enhancements:*
+ * Shortest-path now executes in O(n*log(n)) instead of O(n^2).
+
+*Fixes:*
+ * Shortest-path raises KeyError when the source node is not on the graph;
+ * Bellman-Ford algorithm now works for unconnected graphs (Issue 87);
+ * Linking, unlinking and relinking a hypernode to hyperedge now works as
expected (Issue 86);
+ * Graph comparison does not raise exceptions anymore (Issue 88);
+ * Fixed undesired sharing of attribute lists (Issue 92);
+ * Fixed reading of XML-stored graphs with edge attributes;
+ * Fixed calculation of minimal spanning trees of graphs with
negative-weighted edges (Issue 102).
+
===Release 1.8.0===
Oct 01, 2010