I'm trying to detect some minimal patterns with properties in random digraphs. Namely, I have a list called patterns of adjacency matrix of various size. For in
getaddrinfo
weakmap
r-caret
gdk
plistbuddy
dbus-python
kotlin-companion
wso2mi
file-storage
licensing
.aspxauth
encoder-decoder
numpy-slicing
wpa
f#-3.0
xcode4.5
gmsmapview
opentk
pcm
dry
ucrop
gomoku
ontorefine
phpwkhtmltopdf
stop-words
easynetq
maxifs
twincat-ads
msdasql
symfony-dependency-injection