Talk:Parallel all-pairs shortest path algorithm
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
Objection regarding proposed deletion
[edit]The article was proposed for deletion for the following reason:
Per WP:NOTHOWTO, WP is not an instruction manual on how to do something. There’s already an article on the shortest path problem, methods for solving the problem can be mentioned in that article, properly sourced. They are not a suitable topic for an article on their own.
I do not agree with this statement for the following reasons:
First, in my opinion the range of shortest path algorithms and variations of that problem is too large to be covered by a single article. If you take a look at the graph algorithms category page, there are separate articles for a range of specialized shortest path algorithms. In addition, as shortest path algorithms are such an important field in graph theory in general, it is imho desirable to have this field covered in detail here on wikipedia.
Second, regarding the reference to WP:NOTHOWTO: The problem of parallelizing the presented algorithms is non-trivial, therefore imho this article is not just an instruction manual. I guess what makes it resemble a little to such a manual is the way the idea of the algorithms are explained: The goal is to give the reader an understanding on how these specialized algorihtms are dervied from their sequential counterparts. This is done in several steps to make it easier to understand than just presenting the final psuedocode of the adopted algorithms.