I was confused about some of the wording in this definition I came upon:
Let G be a control flow graph (a control flow graph you can imagine as a directed graph) for program P. A hammock H is an induced subgraph of G with a distinguished node V in H called the entry node and a distinguished node W not in H called the exit node such that
- All edges from (G - H) to H go to V.
- All edges from H to (G - H) go to W.
To my understanding to create an induced subgraph you remove vertices and adjacent edges corresponding to those vertices. (G - H) in this situation I think means all the edges from graph G left over after removing the corresponding edges from graph H. "go to V" I think means the edge in the directed graph points to V. I'm not sure if I'm right about all of these.
I'm having trouble understanding what "(G - H) to H" and "H to (G - H)" mean.
Thanks a lot for you time.