User loginNavigation |
archivesDepth-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 | login or register to post comments | other blogs | 3030 reads
|
Browse archivesActive forum topics |
Recent comments
1 week 5 days ago
42 weeks 7 hours ago
42 weeks 10 hours ago
42 weeks 10 hours ago
1 year 12 weeks ago
1 year 16 weeks ago
1 year 17 weeks ago
1 year 17 weeks ago
1 year 20 weeks ago
1 year 25 weeks ago