<?xml version="1.0" encoding="utf-8"?>
<feed xml:lang="en" xmlns="http://www.w3.org/2005/Atom"><title>Recent changes to feature-requests</title><link href="https://sourceforge.net/p/graphsharp/feature-requests/" rel="alternate"/><link href="https://sourceforge.net/p/graphsharp/feature-requests/feed.atom" rel="self"/><id>https://sourceforge.net/p/graphsharp/feature-requests/</id><updated>2008-09-05T00:59:24Z</updated><subtitle>Recent changes to feature-requests</subtitle><entry><title>The documentation of the Quickgraph algorithms is lacking</title><link href="https://sourceforge.net/p/graphsharp/feature-requests/1/" rel="alternate"/><published>2008-09-05T00:59:24Z</published><updated>2008-09-05T00:59:24Z</updated><author><name>rmiesen</name><uri>https://sourceforge.net/u/rmiesen/</uri></author><id>https://sourceforge.netad2507b5b0af2dd5aeaf08b23273968e217a4ecd</id><summary type="html">&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;</summary></entry></feed>