finesse.script.graph.KatGraph.merge¶

KatGraph.merge(other)[source]¶

Merge other graph into this graph, rewriting paths in other if there are name collisions.

Merging two identical graphs kat –> kat.0 –> kat.0.1, the result would be:

kat --> kat.0 --> kat.0.1
    --> kat.1 --> kat.1.1

Notes

self and other must be trees (is_tree() returns True).