i did my undergraduate and doctoral thesis on the categories of Graphs with multiplication (and/or) as the operator both were done using APL's bit-boolean's
much more than just multiplication were done on these graphs homomorphism, isomorphism clustering cliquing transitive/closures all benefited from the simpler bit-boolean's as categories of graphs run the full gamut from 0-100% full one cannot use any form of linked list a size multiplication by 8 would (at least in those days) have caused a LOT of cache misses even now caching would be a lot happier because the Social Networks under investigation (the object of the studies) have grown a LOT bigger!-) ~greg heil https//picsrp.github.io . ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
