Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

4
  • How did you get more nodes than edges? Commented Jun 8, 2016 at 17:36
  • @Ewan: the control flow graph of print "Hello world" has one node and zero edges. Commented Jun 9, 2016 at 11:27
  • @doc yeah i guess, but i cant imagine calculating the complexity of that function and being confused. wondering what graph the OP used to get their negative value Commented Jun 9, 2016 at 12:59
  • @Ewan: I am pretty sure the OP must have made an error in his calculation (since the proof I gave below works for arbitrary graphs, not just control flow graphs). Lets see if we get a response from him. Commented Jun 9, 2016 at 13:27