Sorry for the confusion. The page just came up in my Wiki search with nothing to distinguish it from the other hits. I'll try to be more careful with my "amazing powers" in the future.
On Fri, Mar 23, 2012 at 3:48 AM, Roger Hui <rogerhui.can...@gmail.com> wrote: > http://www.jsoftware.com/jwiki/RogerHui/t is meant to be > work-in-progress and not available for public viewing (hence the page > name). Ric is a super-duper user with amazing powers and can do > anything, including viewing the "t" page. > > > > On Thu, Mar 22, 2012 at 3:52 AM, Mike Day <mike_liz....@tiscali.co.uk> wrote: >> Thinking to catch up on this thread, I tried >> http://www.jsoftware.com/jwiki/RogerHui/t >> only to get this displayed: >> * "You are not allowed to view this page.*" >> Silly me? - or did you have something else in >> mind? >> >> Mike >> >> On 21/03/2012 1:48 AM, Ric Sherlock wrote: >>> I thought I remembered something on the wiki about this and did a >>> search on it for acyclic. Didn't find what I was looking for but the >>> following pages suggest formats for DAGs: >>> http://www.jsoftware.com/jwiki/Essays/Text Formatting >>> http://www.jsoftware.com/jwiki/RogerHui/t >>> >>> On Wed, Mar 21, 2012 at 12:17 PM, Alexander Mikhailov<avm...@yahoo.com> >>> wrote: >>>> >>>> Hi, >>>> >>>> >>>> I need an implementation of a directed acyclic graph. Both nodes and links >>>> should contain DAG user info, and 2 nodes may have 0 or more (acyclic) >>>> links between them. What could be a good implementation in J? Having a >>>> node I need to (efficiently) find both "following" and "preceding" nodes. >>>> >>>> >>>> So far the best I have is an array of items, each item having 3 boxes. >>>> Item correspond to a node, first box contain node user info (actually, an >>>> integer - index in the separate array of user node data), second box >>>> contains the array of preceding nodes' indexes (integers, indexes in this >>>> same graph array, and integers may repeat as a preceding node may be >>>> connected by more than a single link) and the third box contains array of >>>> pairs "index of following node - index of link's user data in a separate >>>> array". So, third box contains N*2 integers, where N is the number of >>>> links, starting in this node. >>>> >>>> Doesn't look like particularly J style. Do you have any suggestions? >>>> >>>> Thank you, >>>> >>>> Alexander >>>> ---------------------------------------------------------------------- >>>> For information about J forums see http://www.jsoftware.com/forums.htm >>> ---------------------------------------------------------------------- >>> For information about J forums see http://www.jsoftware.com/forums.htm >>> >> >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
