J Algo for the shortest path 
Author Message
 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



Mon, 28 Sep 1998 03:00:00 GMT  
 
 [ 1 post ] 

 Relevant Pages 

1. long = short*short ; (short,short) = long/short

2. Algo chess, Algo damier .FR

3. JS-EAI with *JS*-callback

4. js.exception 3279.js

5. Shortest Path algorithm needed

6. Shortest Path algorithm in APL

7. Shortest path through a network?

8. to GForth add .c by shortest path

9. Shortest path between two points of a graph

10. Dijkstra's shortest path algorithm?

11. Shortest path method

12. Converting fully qualified path to short DOS version

 

 
Powered by phpBB® Forum Software