Talk:Flow graph

This disambiguation page does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Disambiguation This disambiguation page is within the scope of WikiProject Disambiguation, an attempt to structure and organize all disambiguation pages on Wikipedia. If you wish to help, you can edit the page attached to this talk page, or visit the project page, where you can join the project or contribute to the discussion.DisambiguationWikipedia:WikiProject DisambiguationTemplate:WikiProject DisambiguationDisambiguation

Thanks to David Eppstein for adding this to "see also". Obviously this is the same notion as flow graph (unless flow graph is restricted to one sink/exit), but it seems no RS has made this observation. Searching for the terms together I found absolutely nothing useful... JMP EAX (talk) 12:21, 23 July 2014 (UTC)[reply]

There is actually a paper, doi:10.1007/BFb0015447, which uses both concepts, but it calls a flow graph a rooted directed graph. As noted in our article on accessible pointed graph, rooted directed graph is sometimes used to mean there is also path to every node, but in other papers it's not used this way. JMP EAX (talk) 13:42, 23 July 2014 (UTC)[reply]