<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to feature-requests</title><link>https://sourceforge.net/p/graphsharp/feature-requests/</link><description>Recent changes to feature-requests</description><atom:link href="https://sourceforge.net/p/graphsharp/feature-requests/feed.rss" rel="self"/><language>en</language><lastBuildDate>Fri, 05 Sep 2008 00:59:24 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/graphsharp/feature-requests/feed.rss" rel="self" type="application/rss+xml"/><item><title>The documentation of the Quickgraph algorithms is lacking</title><link>https://sourceforge.net/p/graphsharp/feature-requests/1/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;The documentation for many of the Quickgraph algorithms is sub-par at best, and non-existant in other cases. Furthermore, there is NO documentation at all to specify which algorithms can operate on which graphs, or even if that separation is still valid!&lt;/p&gt;
&lt;p&gt;Will pursue this upstream.&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">rmiesen</dc:creator><pubDate>Fri, 05 Sep 2008 00:59:24 -0000</pubDate><guid>https://sourceforge.netad2507b5b0af2dd5aeaf08b23273968e217a4ecd</guid></item></channel></rss>