tangles.separations.finding#

Classes

Abstract Base Class for use with the minimize cut method

Functions

`add_all_corners_of_features()`	Calculates the four corners of every pair of features from an input array
`min_S_T_cut()`	Search a minimal weight S-T-cut in the graph with adjacency matrix A
`minimize_cut()`	Find a locally minimal cut in a graph starting with the cut specified by starting_feature
`nodal_domains()`	Calculate the nodal domains of a function from the vertices of the graph with adjacency matrix A to the real numbers
`pca_features()`	Generate features using a method inspired by Principal Component Analysis (PCA)
`random_features()`	Generates an array of features randomly
`spectral_features()`	Compute spectral bipartitions directly by computing eigenvectors of the complete graph
`spectral_features_splitted()`	Compute spectral bipartitions of a graph after splitting into connected components