Directed-Graph Iterated Function Systems with JULIA

Considering the following directed graph

Where each vertex corresponds to a compact

Assuming that in each iteration each compact has associated with it the function corresponding to the sierpinski triangle, where the edges decide whether the associated compact is considered or not.

Thus in the first iteration we have:

In the second iteration:

An approximation:

This explanation is intuitive, it is recommended that you consult DGIFS_theory. This work is based on gcboore.