Requesting helpd for persistence-based segmentation of scalar-valued edges in a 2D spatial network

[nsarpangala]

Hi GUDHI team,

I am working with a spatially embedded network in 2D where each edge is assigned a scalar value. These values are spatially correlated edges that are close together tend to have similar values.

My goal is to segment the network into connected components where the persistence (based on edge values) exceeds a certain threshold.

Could you please guide me on which example in the GUDHI TDA notebooks would be most relevant to this task? I am looking for workflows or functions that can handle scalar functions defined on edges rather than nodes.

Thanks,
Niranjan

[mglisse]

Hello,
sorry, I don't understand your description of the problem, maybe a very small example (a graph with ~4 vertices?) showing what you want could clarify things?
Do https://docs.scipy.org/doc/scipy/reference/generated/scipy.sparse.csgraph.connected_components.html and https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.components.connected_components.html compute something relevant?