Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.javascript > #26354 > unrolled thread
| Started by | jonas.thornvall@gmail.com |
|---|---|
| First post | 2014-12-17 22:36 -0800 |
| Last post | 2014-12-18 01:11 -0800 |
| Articles | 3 — 2 participants |
Back to article view | Back to comp.lang.javascript
Minimise total steps and average node connectivity. jonas.thornvall@gmail.com - 2014-12-17 22:36 -0800
Re: Minimise total steps and average node connectivity. jonas.thornvall@gmail.com - 2014-12-17 23:05 -0800
Re: Minimise total steps and average node connectivity. "Chris M. Thomasson" <no@spam.invalid> - 2014-12-18 01:11 -0800
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2014-12-17 22:36 -0800 |
| Subject | Minimise total steps and average node connectivity. |
| Message-ID | <db6a634b-5776-4bd1-972c-f9e45e0d2356@googlegroups.com> |
I will try to construct a generic node optimizer, to minimize number of steps needed to travel between any points/nodes within a graph tree that have symmetric branch structure. Before i start can i ask, am i inventing the wheel again, not that it really matter i will go through with it anyway it is for recreation. But is the optimal algorithm for travelling a symmetric branch tree in least number of steps using x extensions from y nodes already known? Jonas
[toc] | [next] | [standalone]
| From | jonas.thornvall@gmail.com |
|---|---|
| Date | 2014-12-17 23:05 -0800 |
| Message-ID | <070b6f47-8d58-47f5-8f07-29a1992a301b@googlegroups.com> |
| In reply to | #26354 |
Den torsdagen den 18:e december 2014 kl. 07:36:44 UTC+1 skrev jonas.t...@gmail.com: > I will try to construct a generic node optimizer, to minimize number of steps needed to travel between any points/nodes within a graph tree that have symmetric branch structure. > > Before i start can i ask, am i inventing the wheel again, not that it really matter i will go through with it anyway it is for recreation. > > But is the optimal algorithm for travelling a symmetric branch tree in least number of steps using x extensions from y nodes already known? > > Jonas Maybe i should rephrase question are ther any other solutions then bruteforce known?
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <no@spam.invalid> |
|---|---|
| Date | 2014-12-18 01:11 -0800 |
| Message-ID | <m6u5or$97q$1@speranza.aioe.org> |
| In reply to | #26354 |
> wrote in message > news:db6a634b-5776-4bd1-972c-f9e45e0d2356@googlegroups.com... > [...] > But is the optimal algorithm for travelling a symmetric branch > tree in least number of steps using x extensions from y nodes > already known? I guess you can try some of these: http://www.engr.colostate.edu/~ramirez/ce_old/projects/NetworkEvolution.pdf http://www.pnas.org/content/110/48/19295.abstract http://info.ifpan.edu.pl/SL-4/website/publications/sl4_96.pdf http://onlinelibrary.wiley.com/doi/10.1029/92WR02985/abstract Sorry if this is not relevant.
[toc] | [prev] | [standalone]
Back to top | Article view | comp.lang.javascript
csiph-web