Re: How to know which points form some bar code

Dmitriy Morozov

Thanks. Given two cycles z1 and z2, to decide if they are homologous, you need to check if (z1 - z2) is a boundary. If you have a ReducedMatrix m (from include/dionysus/reduced-matrix.h), you can check if a cycle is a boundary, by checking if m.reduce(z) == m.unpaired(). To compute the difference, (z1 - z2), you need Chain<...>::addto(...) (from include/dionysus/chain.h).

On Thu, Jul 26, 2018 at 3:48 PM, <nchristianson@...> wrote:
Done - out of curiosity, where within the codebase is this functionality?

Join to automatically receive all group messages.