Now, of course, it would be more readable 4 and 5 going to 6, and 6 going to 2, without needing 7. Apparently there in this flow graph the 6 would be a "no-op" of its above algorithm
So that seven could be disposed of without a problem... I have another exercise that the code is very similar to that ,only in the while part there are two conditions that is like this: while((a<0) or (b<-2)) in which case I would have to separate each while condition into a new node? (I’ll see if I can print out the exercise).
I think both 4 and 5 would go back to 2...
– Jefferson Quesado
Now, of course, it would be more readable 4 and 5 going to 6, and 6 going to 2, without needing 7. Apparently there in this flow graph the 6 would be a "no-op" of its above algorithm
– Jefferson Quesado
So that seven could be disposed of without a problem... I have another exercise that the code is very similar to that ,only in the while part there are two conditions that is like this: while((a<0) or (b<-2)) in which case I would have to separate each while condition into a new node? (I’ll see if I can print out the exercise).
– CodeInsane