Skip to content

Fixed acyclic coloring #85

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 7 commits into from
Dec 27, 2019
Merged

Conversation

pkj-m
Copy link
Contributor

@pkj-m pkj-m commented Dec 27, 2019

Implemented modified version of acyclic coloring algorithm using disjoint sets with root as integer (representing the edge's position in the graph) instead of the edge object itself to avoid unforeseen errors. Also enforced initialization of the tuple vectors with (0,0) instead of undef to avoid random errors.

Few performance enhancements that are possible in this implementation:

  1. use hashmap to save the edges' keys instead of iterating every time to find edge index
  2. implement tests using the standard SimpleGraphs(nv, ne) function instead of generating graphs using rand(1:nv)

Fixes #75

@matbesancon
Copy link
Contributor

Still some errors, do you know where to look at?

@pkj-m
Copy link
Contributor Author

pkj-m commented Dec 27, 2019

@matbesancon are you talking about errors in this PR or the travis build? It seems the build is failing because of some issues with methods related to BlockBandedMatrices. Acyclic tests are passing.

@matbesancon
Copy link
Contributor

matbesancon commented Dec 27, 2019 via email

@ChrisRackauckas ChrisRackauckas merged commit cdd802f into JuliaDiff:master Dec 27, 2019
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.

acyclic coloring test error
3 participants