Re: find all paths of length n in a graph


Do you know where your variables are?
	PerlMonks

Re: find all paths of length n in a graph

by tbone1 (Monsignor)

on Jan 10, 2006 at 18:17 UTC ( [id://522264]=note: print w/replies, xml )

Need Help??

in reply to find all paths of length n in a graph

A couple things:

1) There is no limit on word length. Well, okay, there is; they can only be up to sixteen characters because you can't re-use a letter.
2) Using a LOL (list of lists), 4x4, is probably a better way to go. That eliminates the need to carry around %adjacency_list, for one thing.
Hope this helps.

--
tbone1, YAPS (Yet Another Perl Schlub)
And remember, if he succeeds, so what.
- Chick McGee