https://bugs.freedesktop.org/show_bug.cgi?id=90887 --- Comment #21 from jr --- Created attachment 117077 --> https://bugs.freedesktop.org/attachment.cgi?id=117077&action=edit Prototype of a more highlevel graph modification api After I realized that the prev/next arrays actually represent *two* linked lists (one for the source and one for the target side) and that these are circular it became easier:-) I have attached a prototype of what I was hinting at in my first post. This is only lightly tested (but seems to work for Lifeless Planet at least) and I'm not sure that Pass is the correct place for the new method to live. It would probably also be nice if edge splitting kept both the outgoing and the incoming list of source and target resp. intact. One improvement of this patch above my original proposal is that it produces the same edge types as the current code. My earlier patch would keep the edge type instead of setting it to FORWARD. While fixing that I was wondering whether TREE is always correct for the edge into the new BB. -- You are receiving this mail because: You are the QA Contact for the bug. You are the assignee for the bug.