search for: dsgraph_2nodes

...alloc(sizeof(list)); Result->X = 1; Result->Next = malloc(sizeof(list)); Result->Next->X = 2; Result->Next->Next = 0; } int main() { MakeList(); return 0; } ---------- You can view the corresponding DSGraph here: http://www.liacs.nl/~hvdspek/images/dsgraph_2nodes.png Though one of the 2 nodes doesn't have the R flag, this is not the problem. Adding a printf statement does add the R flag, but still we get 2 nodes. Does anybody have an idea why these nodes are not merged? Harmen