Talk:Wait-for graph

Untitled
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
--CopyToWiktionaryBot (talk) 04:58, 29 January 2008 (UTC)

Capitalization
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)

Fix the problem now
Fix the problem plain and simple simply fix the fing problem. It's driving me completely crazy. Fix it. 47.224.44.135 (talk) 02:30, 8 October 2022 (UTC)