Minimum Spanning Tree by I., S.(shinh,recursive,et al.(set algebra))

do'wd;:inv(''TF''{~=/S[(;S)=.<~.;S=:do&.>}:{:C);{:C=:1|.C'"{C[(Y)=.<">Y=:,}:|:C=:(;:/:0&do)];._1(,stdin)LF

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

download

return to the top page