# Thursday, December 04, 2008
QuickGraph 3.1 – .net 2.0 support – Fibonacci Heap

I just released a new version of QuickGraph. Among many small improvements here and there, the big news are:

  • .net 2.0 support is back! QuickGraph now builds both for .net 2.0 and .net 3.5 (with extension methods).
  • The Dijkstra algorithm use a Fibonacci Heap under the hood, which is way more efficient. Courtesy of Roy Williams!
  • better serialization support and other bug fixes.

Enjoy, Peli.

QuickGraph
posted on Thursday, December 04, 2008 12:28:30 AM (Pacific Standard Time, UTC-08:00)  #    Comments [2]
Related posts:
QuickGraph for Silverlight (new release)
QuickGraph on Code Contracts
Tarjan Offline Least Common Ancestor in C# (with QuickGraph)
A K-Shortest Path implementation in .Net
Testing Graph Algorithms With Optimal Solutions
Writing a DisjointSet in C# with the help of Code Contracts and Pex.
Thursday, December 11, 2008 6:34:17 PM (Pacific Standard Time, UTC-08:00)
Come back to say go! go! go! Quickgraph after more than one year. ^_^
lonelystranger
Tuesday, January 13, 2009 12:04:01 AM (Pacific Standard Time, UTC-08:00)
hi, please move the project to google code. codeplex is painfully slow.
i'm trying just now for about 5 minutes to download the latest releases.
https://www.google.com/accounts/o8/id?id=AItOawlxwb-ClN_bdkJ4Q9DBqLM_RmBfBqgM-Yg
Comments are closed.

Page rendered at Saturday, July 04, 2009 2:16:45 PM (Pacific Daylight Time, UTC-07:00)