Jump to content

Talk:Dijkstra–Scholten algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RobinK (talk | contribs) at 20:44, 2 January 2010 (Rating article for WikiProject Mathematics. Quality: Start / Priority: Low / Field: discrete (script assisted). Please report any errors on my talk page.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Dijkstra-Scholten Algorithm for a Tree

"Dijkstra-Scholten Algorithm for a Tree" and "Algorithm" headings should be merged. -- McoreD.