Shan-man
¿sɐɯʇsıɹɥɔ lıʇ, sʎɐp ʎuɐɯ ʍoH
- Joined
- Aug 12, 2008
- Messages
- 2,806
First let me apologize, I would not normally repeat a post from the Community board, but am doing it now since this project will mainly be for use in the Camping Board, and since we have a different group of folks over here (and I'm getting no bites on the community board
)
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. I have also tried teaching myself VisualBasic in Excel but my head is near to bursting like a melon from being hit on the wall!
I need help.
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, 12 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.
Thanks in advance,


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. I have also tried teaching myself VisualBasic in Excel but my head is near to bursting like a melon from being hit on the wall!

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, 12 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.
Thanks in advance,
