Fig. 5
From: Efficient orbit-aware triad and quad census in directed and undirected graphs
Top: Configurations that have to be found by our algorithm. Bottom: Resulting patterns to be detected when processing node u. Filled nodes are marked as neighbors of u