Skip to content

Additional centroid (and shallowest) tree decomposition implementation - #120

Open
bjorn-martinsson wants to merge 1 commit into
cheran-senthil:masterfrom
bjorn-martinsson:new_centroid_decomposition
Open

bjorn-martinsson wants to merge 1 commit into
cheran-senthil:masterfrom
bjorn-martinsson:new_centroid_decomposition

Conversation

@bjorn-martinsson

Copy link
Copy Markdown
Collaborator

Currently Pyrival has a centroid decomposition implementation that I'm rather fond of. But after learning of shallowest tree decomposition and writing a blog about it https://codeforces.com/blog/entry/125018 I've realized that there is another style of implementation that is nice to have.

This PR contains two algorithms. It contains a centroid decomposition implementation and an implementation of shallowest tree decomposition. The two are designed to be easily swapped, which is very nice. Especially if you want to experiment with comparing runtimes.

However, I am unsure of what do with the old centroid decomposition implementation. I personally would probably like to keep both. But I'm not sure what to call the files to make this clear.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant