Yes, in most cases it helps. Gramps won't give me a name for the
relationship then, but it will still calculate the path(s) between
No, the logic will be to blame, not the programming
language used. Normally we should cache people already scanned,
but you must hit a bug there. You can reduce the number of
generations to do the calculation?
H'm, yes, sort of. I decided to cut off the royals from my main
tree, and in that, I don't see Gramps loop on this anymore, although
I do see a few print lines for one person. The royals are in a
separate file now, and in that, I can simply trigger the loop.
I will export that database, and attach it to
so you can see for yourself.
I said sort of here, because with this VORSTEN database, I see
Gramps print lots lines with m's and f's, and one doesn't really
look more complicated than the other. The rel strings are about 12
to 13 chars long, and the printing goes on and on and on, even with
the default 15 generations setting.