|  | 
|  | 
| back to board | I'm really  mad of solving  this problem... Why the minimal spanning tree doesn't work? And what is the right solution? (-) Posted by WAZZAP  19 Oct 2002 18:00Isn't the MST, you MUST know TREE<>PATH >And WHAT is the diffrence?... Posted by WAZZAP  30 Dec 2002 02:08What, what is the difference? i just cannot understand - if this is aSteiner problem (if you can add the additional vertices to a graph to
 shorter the PATH), there is no solution acceptable (steiner problem
 has not been solved, hasn't it?)
Re: And WHAT is the diffrence?... Posted by wsk  26 Aug 2010 07:57OH I see! | 
 | 
|