Minimum Spanning Tree by yshl

[60{[3{(%stdin)(r)file token pop dup dup def}repeat]}repeat]{2 get exch 2 get
gt}.sort{aload pop 2 index load 2 index load eq{(F )}{(T )}ifelse print 2 -1
1{index =only( )print}for = load exch load currentdict{3 index eq{1 index def
0}if pop}forall}forall

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page