|
|
вернуться в форумI'm really mad of solving this problem... Why the minimal spanning tree doesn't work? And what is the right solution? (-) Послано WAZZAP 19 окт 2002 18:00 Isn't the MST, you MUST know TREE<>PATH > And WHAT is the diffrence?... Послано WAZZAP 30 дек 2002 02:08 What, what is the difference? i just cannot understand - if this is a Steiner 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?... Послано wsk 26 авг 2010 07:57 OH I see! |
|
|