|WikiProject Computing||(Rated Stub-class)|
I removed the banner to take this article down because it was too short or whatnot and wrote up a little bit more to describe what this is, it is not a lot by any means, but i think it explains the concept well enough to justify not deleting the article. Andykonwinski (talk) 05:40, 19 February 2008 (UTC)
2008-01-29 Automated pywikipediabot message
|This page has been transwikied to Wiktionary.
The article has content that is useful at Wiktionary. Therefore the article can be found at either here or here (logs 1 logs 2.)
Note: This means that the article has been copied to the Wiktionary Transwiki namespace for evaluation and formatting. It does not mean that the article is in the Wiktionary main namespace, or that it has been removed from Wikipedia's. Furthermore, the Wiktionarians might delete the article from Wiktionary if they do not find it to be appropriate for the Wiktionary.
Removing this tag will usually trigger CopyToWiktionaryBot to re-transwiki the entry. This article should have been removed from Category:Copy to Wiktionary and should not be re-added there.
In some places (such as this article) the capitalized form of wait-for graphs has the F capitalized too, while in other sources it is not capitalized (such as the title of this article). The lower-case f looks better to me, but I am not sure.--CyHawk (talk) 17:57, 25 August 2008 (UTC)
I think this is because usually in algorithms when P sub x denotes a process, the P is capital; however, in graph theory vertices are always lowercase. In this case P is denoting both simultaneously. --voidlogic 16:53, 3 October 2008 (UTC) —Preceding unsigned comment added by 22.214.171.124 (talk)