(Brian Thomas rhea hw14) |
|||
| Line 1: | Line 1: | ||
My solution (using Dijkstra's algorithm): Length is 16. (path is a to b to e to h to l to m to p to s to z) Does anyone agree/disagree? | My solution (using Dijkstra's algorithm): Length is 16. (path is a to b to e to h to l to m to p to s to z) Does anyone agree/disagree? | ||
-Brian ([[User:Thomas34|Thomas34]] 22:16, 10 December 2008 (UTC)) | -Brian ([[User:Thomas34|Thomas34]] 22:16, 10 December 2008 (UTC)) | ||
| + | |||
| + | ---- | ||
| + | Got the same thing. --[[User:Asuleime|Asuleime]] 09:40, 12 December 2008 (UTC) | ||
Revision as of 05:40, 12 December 2008
My solution (using Dijkstra's algorithm): Length is 16. (path is a to b to e to h to l to m to p to s to z) Does anyone agree/disagree? -Brian (Thomas34 22:16, 10 December 2008 (UTC))
Got the same thing. --Asuleime 09:40, 12 December 2008 (UTC)
