IGraph.Motif

Documentation

triad :: [LGraph D () ()]

Every triple of vertices in a directed graph 003: A, B, C, the empty graph. 012: A->B, C, a graph with a single directed edge. 102: A-B, C, a graph with a mutual connection between two vertices. 021D: A-B-C, the binary out-tree. 021U: A->B<-C, the binary in-tree. 021C: A->B->C, the directed line. 111D: A-B<-C. 111U: A-B->C. 030T: A->BA-C. Feed forward loop. 030C: AA-C. 201: A-B-C. 120D: A-B-C, A-C. 120U: A->BA<-C. 120C: A->B->C, A-C. 210: A->B-C, A-C. 300: A-B-C, A-C, the complete graph.

triadCensus :: (Hashable v, Eq v, Read v) => LGraph d v e -> [Int]