Yes, also TC can be performed in the same time as a matrix multiplication. i did the same in APL (using bit boolean which J lacks) in the same area, social networks
---~ Heil, G. H. and H. C. White 1976 “An algorithm for finding simultaneous homomorphic correspondences between graphs and their image _ graphs”. Behavioral Science 21:26 - 35 greg ~krsnadas.org -- from: Roger Hui <[email protected]> to: Programming forum <[email protected]> date: 12 September 2013 16:00 subject: Re: [Jprogramming] pattern matching in J >This is an instance of the transitive closure problem. In the matrix form it can be solved as +./ .*./~^:_ M , the power limit of repeated squaring by the or-and inner product. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
