Files
agda-utils/AgdaUnusedOpens.Test/Example.dot

24 lines
440 B
Plaintext

digraph dependencies {
m0[label="Sequences"];
m1[label="Setoids.Setoids"];
m6[label="Numbers.Naturals.Definition"];
m2[label="LogicalFormulae"];
m3[label="Agda.Primitive"];
m4[label="Functions"];
m5[label="Sets.EquivalenceRelations"];
m0 -> m1;
m0 -> m2;
m0 -> m6;
m1 -> m2;
m1 -> m3;
m1 -> m4;
m1 -> m5;
m2 -> m3;
m4 -> m2;
m4 -> m3;
m5 -> m2;
m5 -> m3;
m5 -> m4;
m6 -> m2;
}