Talk:Wait-for graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing (Rated Stub-class)
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology 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.
Stub-Class article Stub  This article has been rated as Stub-Class on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.
 
Note icon
This article has been automatically rated by a bot or other tool as Stub-Class because it uses a stub template. Please ensure the assessment is correct before removing the |auto= parameter.

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)

Does anyone know of an example usage/image of this? Welcor (talk) 14:39, 12 April 2008 (UTC)

2008-01-29 Automated pywikipediabot message[edit]

--CopyToWiktionaryBot (talk) 04:58, 29 January 2008 (UTC)

Capitalization[edit]

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 138.49.242.200 (talk)