Preparing release 2.0.0

Author: Adam Groszer

Changelog

@@ -14,7 +14,7 @@ Enhancements:
 	New location, and new main maintainers.
 	Various fixes and improvements to the Makefile and test running.
 	Automatic tests and coverage of master and pull request with Travis and Coveralls.
-    Make shortest_path (Dijkstra's algorithm) run in O(E log V) instead of O(E^2) (dkorduban)
+2.0.0 (2025-06-13)
     Make graph.add_edge run in O(1) instead of O(degree(V)) (dkorduban)
     Added implementation of Kruskal's Minimum Spanning Tree construction algorithm (goldragoon)
     Repackaged and updated to python3 (robinharms)