(C/C++) data dependency graph goes wrong when there is a 'goto' statement

[NemoTR]

This is part of the C++ source code:

int g(int a)
{
LOOP:
    if (a <= 100)
    {
        a += 3;
        goto LOOP;
    }
    else
        return a;
}

Its ddg is:

The call node a += 3 has no outedge at all.