User loginNavigation |
Depth-first search in APLThe latest video in Dyalog's library - Depth-First Tree-Search in APL - is now available (https://www.youtube.com/watch?v=DsZdfnlh_d0) The classic depth-first search algorithm is explored using APL, a simple and concise array notation with high-order functions. The presentation highlights APL's incremental development style, using simple steps and culminating in a purely functional solution for the N-Queens problem. The informative style of this presentation brings clarity to this advanced topic, making it accessible even to those who are still near the start of their APL journey. Once you've seen the video, why not examine the code used in greater detail and try the expressions for yourself in the online tutorial at http://tryapl.org/ (Learn tab > Depth-first search) By ngn at 2014-07-21 13:42 | LtU Forum | previous forum topic | next forum topic | other blogs | 2865 reads
|
Browse archives
Active forum topics
|
Recent comments
14 weeks 2 days ago
18 weeks 4 days ago
20 weeks 1 day ago
20 weeks 1 day ago
22 weeks 6 days ago
27 weeks 3 days ago
27 weeks 3 days ago
27 weeks 6 days ago
27 weeks 6 days ago
30 weeks 5 days ago