g =: ? 10 10 $ 2 0 8 ((g gridExtendPath) aStar manhattanDistance) 5 0 Hypothetical Dijkstra's Search on an arbitrary graph: 'Z' (graphExtendPath aStar 1:) 'A'
Hypothetical A* for hex grid: goal (hexGridExtendPath aStar euclideanDistance) start - Max On Sun, Jul 8, 2012 at 11:02 PM, Raul Miller <rauldmil...@gmail.com> wrote: > On Sat, Jul 7, 2012 at 8:59 PM, Max Harms <raeli...@gmail.com> wrote: > > Here's the functioning code if you're curious: > http://pastebin.com/RjQA69j6 > > I'm curious. > > How do you use this? (What are some sample sentences.) > > [Especially when you are working with adverbs and conjunctions, but > also even with verbs, examples help illustrate the relevant domains.] > > Thanks, > > -- > Raul > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
