J Algo for the shortest path

Hello,

I search an algorithm in J for finding the shortest path from a to b

in an graph. The graph is given in an adjacent matrix. As output I

would like an list with the nodes, where a the first and b the last

node.

Also I search an manual for J in printable form, I have the Windows

Helpfiles only.

Thank in advance for any answer

--

Steffen K"ohler