[scilab-Users] min_weight_tree for non oriented graph

[Michael J. McCann]

Pierre,
         I know nothing at all about minimum weight trees, but I just 
looked at your result as if it was a "net-list" What I see is that 
starting at node 1, all the other nodes are reachable but for 
example, to get to 4 you have to go: 1-2-8-5-4 which means that the 
links 4-5 and 5-8 are traversed in the opposite direction to that in 
which they are listed, but, after all, it's a "non-oriented graph". :-)
Cheers, Mike.
ps: you can actually start anywhere and reach all the other nodes.
===================================
At 08:00 2008-05-10, you wrote:
>.....  with a non oriented graph, i do not understand the result, 
>and for my understanding, the result is not a tree...
>
>before creating a request or bug, i imagine someone can explain more...
>....................
>-->arbre
>arbre  =
>
>     1.     2.
>     2.     3.
>     4.     5.
>     5.     8.
>     6.     11.
>     2.     7.
>     2.     8.
>     9.     10.
>     1.     10.
>     1.     11.
>     11.    12.
>     6.     13.
>     6.     14.
>     6.     15.
>
>For me, in a tree, the root is the only node with no head ...
>in this example: 1,4,6,9... that is a forest ! ......