Talk:Decision-to-decision path

	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.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
???	This article has not yet received a rating on the project's importance scale.
	This article is supported by WikiProject Software.

I'm trying to learn about this and related concepts for class, so I can't write much about it (yet?). Wikipedia seems to be missing an important branch of research here. I think this relates to Cyclomatic complexity somehow. -- Bilbo1507 05:06, 25 February 2007 (UTC)[reply]

Same thing as basic block?

Google Books finds [1] "A DD-path is a section of straight-line code between predicates in a program — or, more simply, a basic block." 188.27.81.64 (talk) 05:25, 18 July 2014 (UTC)[reply]

Apparently not under Jorgensen's definition, although it might be the same under Huang's. The latter used to be cited a lot, but more recently with Jorgensen giving free slides to instructors with his book, a lot of Jorgensen's definition pops up, especially in course materials.

I found Jorgensen's definition of "(improved) program graph" as "nodes are either statements or fragments of a statement, and edges represent flow of control [obvious explantion what the edges mean follows]". So definitely not a CFG. It appears it's defined in terms of some generic source language that itself isn't specified, like what's a "statement fragment" in that language. Intllgnt sgn unlss cmpltly knwn (talk) 12:05, 18 July 2014 (UTC)[reply]