Talk:Dijkstra's algorithm: Difference between revisions

Content deleted Content added
Peasaep (talk | contribs)
Line 67:
 
The article starts talking about the "relaxation condition" without defining it; I don't think this is very clear but I don't feel confident about editing it. http://stackoverflow.com/questions/2592769/what-is-the-relaxation-condition-in-graph-theory sort of explains (external link) but I can't find a decent definition within Wikipedia. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/88.104.125.53|88.104.125.53]] ([[User talk:88.104.125.53|talk]]) 10:30, 12 April 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->
 
== Cleaning up inconsistencies ==
 
I've tried to (begin to) address a few issues with this page that have been previously mentioned. Namely:
* The first algorithm referred to a '''set''', but then used priority queue operations on the set. A separate priority queue algorithm was then introduced. Either there should only be a single algorithm, or the first, simpler algorithm should stick to using a set
* The algorithms referred to 'relaxing' edges without defining what this is or linking to a definition
* The algorithms were inconsistent with each other, i.e. they did the same initialization in different ways. There were odd semicolons after some lines in the first algorithm, not the second.
 
I think there are larger issues with individual pages that use graphs being inconsistent with each other, and with the main [[Graph]] article itself. It would be nice if we could come up with a standard way of describing graphs and graphing algorithms, but these are bigger issues that will take a lot more work to address. --[[User:Peasaep|Peasaep]] ([[User talk:Peasaep|talk]]) 06:44, 25 May 2014 (UTC)