MST: Minimum Spanning Tree algorithm for identifying large-scale filaments

Discussion topics for individual codes
Post Reply
Ada Coda
ASCL Robot
Posts: 1839
Joined: Thu May 08, 2014 5:37 am

MST: Minimum Spanning Tree algorithm for identifying large-scale filaments

Post by Ada Coda » Mon Feb 22, 2021 11:00 pm

MST: Minimum Spanning Tree algorithm for identifying large-scale filaments

Abstract: MST (Minimum Spanning Tree) identifies velocity coherent large-scale filaments through ATLASGAL clumps. It can also isolate filaments embedded in a crowded position–position–velocity (PPV) space. One strength of this method is its repeatability compared to manual approaches.

Credit: Wang, Ke; Ge, Yifei

Site: https://github.com/pkugyf/MST
https://ui.adsabs.harvard.edu/abs/2016ApJS..226....9W

Bibcode: 2021ascl.soft02002W

ID: ascl:2102.002
Last edited by Ada Coda on Sat Mar 06, 2021 1:41 am, edited 1 time in total.
Reason: Updated code entry.

Post Reply