######### ########## ### ### ######### ########## ######### ########### ### ### #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+#+#+#+ +####+ #+#+#+#+# #+#+#+#+ +#+#+#+#: #+# +####+ #+# #+# #+# +#+ +#+ #+# #+# +#+ +#+ #+# +#+ +#+ #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# #+# ######### ########## ### ### ### ########## ### ### ########### ### ### # # ### # # ##### #### ## ### ##### # # # # # ## ## #_ # # # # # # # # ##### # # ## ## ### # # # # # ## ### # # # # # # # # # # #### ##### # # # # # # ### # # ##### # # # ### #####
Not a bad implementation of the algorithm, looking for minimal sewing tree. Graf kept a list of ribs. Used a rapid screening (QSort). To work with sets realized Forest disjoint sets.