Finding Largest Subsets in Correlation Matrices: A Graph Theory Approach Using NetworkX