You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I think we'd want to have some requirement about the edge structure. We should really only be merging handles that form a non-branching path in the graph.
That's a good point. The edge structure has to be unbranching and paths
have to be contiguous across the set of nodes to merge.
I'm not sure how useful this is. I guess it helps for simplifying the graph
structure.
On Fri, Jan 10, 2020, 19:47 Jordan Eizenga ***@***.***> wrote:
I think we'd want to have some requirement about the edge structure. We
should really only be merging handles that form a non-branching path in the
graph.
—
You are receiving this because you authored the thread.
Reply to this email directly, view it on GitHub
<#42?email_source=notifications&email_token=AABDQEI3RZXHYLKU3PUHC33Q5C7FBA5CNFSM4KFGYVSKYY3PNVWWK3TUL52HS4DFVREXG43VMVBW63LNMVXHJKTDN5WW2ZLOORPWSZGOEIU3NEA#issuecomment-573159056>,
or unsubscribe
<https://github.com/notifications/unsubscribe-auth/AABDQEPHFPSP7OT274APBNDQ5C7FBANCNFSM4KFGYVSA>
.
I'd like to match divide_handle with an inverse function that combines handles back together.
This would be the signature:
Any thoughts?
The text was updated successfully, but these errors were encountered: