User Tools

Site Tools


contest_2010-10-14

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
contest_2010-10-14 [2010/10/15 04:25] jtkorbcontest_2010-10-14 [2010/10/15 05:15] (current) jtkorb
Line 23: Line 23:
 **Notes:** **Notes:**
  
-  * A: Straight-forward recursive walk of the graph will do.  Use a marker to keep track of nodes you've already visited.+  * A: Recursive walk of the graph will do.  Use a marker to keep track of nodes you've already visited.
   * B: Tricky.  Use Dijkstra's (or possibly Floyd's) algorithm multiple times.   * B: Tricky.  Use Dijkstra's (or possibly Floyd's) algorithm multiple times.
   * C: Dynamic programming.  Sort and find recurrence.  (Actually, simple iteration works, too.)   * C: Dynamic programming.  Sort and find recurrence.  (Actually, simple iteration works, too.)
-  * D: Dynamic programming.  Use divide and conquer trying each possible initial slice in turn.+  * D: Dynamic programming.  Use recursive divide and conquer trying each possible initial slice in turn.
contest_2010-10-14.txt · Last modified: 2010/10/15 05:15 by jtkorb