Talk:Flow graph

Accessible pointed graph

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]

Relation to term graph

There is actually a paper, Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1007/BFb0015447, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1007/BFb0015447 instead. 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]