Home |
Search |
Today's Posts |
#1
Posted to microsoft.public.excel.programming
|
|||
|
|||
Minimum route from two nodes
Could you recomand me a math forum where I can ask this question -- stefante ----------------------------------------------------------------------- stefantem's Profile: http://www.excelforum.com/member.php...fo&userid=1359 View this thread: http://www.excelforum.com/showthread.php?threadid=26312 |
#2
Posted to microsoft.public.excel.programming
|
|||
|
|||
Minimum route from two nodes
In Mathematica, the command for this is called "ShortestPath" which operates
on a undirected graph (or directed I believe, but I've never tried it) given two nodes. It can use either the Dijkstra's, or Bellman-Ford algorithm. I've look at the code, and basically, it's way over my head. In Excel, I'm not sure how you would do it. For your graph, you would need some method to specify Vertices, and another area to specify Edges. In an Excel graph, it's hard to extract this information. Good luck. Dana DeLouis "stefantem" wrote in message ... Could you recomand me a math forum where I can ask this question? -- stefantem |
Reply |
Thread Tools | Search this Thread |
Display Modes | |
|
|
Similar Threads | ||||
Thread | Forum | |||
how to delete duplicate file example route 2_2:1 or route 2_2:2 | Excel Discussion (Misc queries) | |||
Minimum route from two nodes | Excel Programming | |||
Minimum route from two nodes | Excel Programming | |||
XML selecting sinlge nodes with name selectionNamespaces | Excel Programming | |||
treeview add nodes | Excel Programming |