Shan-man
¿sɐɯʇsıɹɥɔ lıʇ, sʎɐp ʎuɐɯ ʍoH
- Joined
- Aug 12, 2008
- Messages
- 2,806
The author of this posting assumes no resposibility for glazed-over looks or drool on keyboards. Non-techies may want to avert their eyes:
Hey guys, I was hoping we might have a programmer in our midst who might be interested in writing a bit of code to help complete a project I've been working on for the benefit of the camping forum community? I've been trying a somewhat manual method, but am beginning to realize it is too big to reasonably do manually. Specifically, I need a custom implementation of the Dijkstra algorithm, where I can feed a list of connected nodes and their weights and get back a list: start node, finish node, route taken, and total weight for route. If Dijkstra is too hard to implement, a brute force calculation of all routes under, say, 15 nodes would work too and I could just filter out the non-optimal routes. I can, of course explain it in greater detail (i.e. less covertly) via PM.
TIA,

You may now resume your normal, light reading. That is all.
Hey guys, I was hoping we might have a programmer in our midst who might be interested in writing a bit of code to help complete a project I've been working on for the benefit of the camping forum community? I've been trying a somewhat manual method, but am beginning to realize it is too big to reasonably do manually. Specifically, I need a custom implementation of the Dijkstra algorithm, where I can feed a list of connected nodes and their weights and get back a list: start node, finish node, route taken, and total weight for route. If Dijkstra is too hard to implement, a brute force calculation of all routes under, say, 15 nodes would work too and I could just filter out the non-optimal routes. I can, of course explain it in greater detail (i.e. less covertly) via PM.
TIA,

You may now resume your normal, light reading. That is all.