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
prolog-findall
design-tokens
utf-7
getelementbyid
autoresizingmask
android-13
natural-logarithm
windows-scripting
wfastcgi
chrome-options
xmlwriter
ios13.4
google-cloud-profiler
stateless
in-memory
jazzy
android-unit-testing
screen-size
perceptron
ssis
dtreeviz
animatorset
scatterview
s3-rewrite-rules
infineon
lit-element
jscompiler
thorntail
srt
ppp