Anonymous user
Talk:Transportation problem: Difference between revisions
+ note about the Java/D Versions
m (→Task Description: grammar) |
(+ note about the Java/D Versions) |
||
Line 14:
: I fail to see the benefit. The NW method is too simple to be given its own task page, so it's nice to have it included in this one. More sophisticated methods can be handled in separate tasks and we can link to them from here. [[User:Fwend|Fwend]] ([[User talk:Fwend|talk]]) 12:47, 18 September 2014 (UTC)
:: Also I think it's better for testing purposes if the initial feasible solution is off the mark. That way your optimal solution routine is more pressured to produce a correct result than when you have an estimate that may already be correct to begin with. [[User:Fwend|Fwend]] ([[User talk:Fwend|talk]]) 13:16, 18 September 2014 (UTC)
==Regarding The Java/D Versions==
I have converted the Java version to D language. I've used a class Shipment as in the Java code. Perhaps there are good enough ways to use values (a matrix of structs) instead, and reduce indirections.
I have found the function getClosedPath() not easy to understand and semantically a little complex (and bug prone to translate). So can you comment the parts of getClosedPath() to help me write simpler D code, or can you restructure it to make its workings more linear (in D I've used three different 'stones' variables inside it, including a dup-ping)?
| |||