Imagine you're going to walk to a friend's house. If the house is a few doors down, you don't need to make any decisions. But if your friend is further away, you may come to an intersection. You choose a direction and come to another intersection, and so on. How many paths are there to your friend's house?

That's cyclomatic complexity in a nutshell.

The number of independent paths through a method.

Map1

Map2