Skip to content
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

Is initial solution important? #24

Closed
kyuridenamida opened this issue Sep 24, 2017 · 2 comments
Closed

Is initial solution important? #24

kyuridenamida opened this issue Sep 24, 2017 · 2 comments

Comments

@kyuridenamida
Copy link
Owner

kyuridenamida commented Sep 24, 2017

I need to compare these three initial solutions:

  • Random shuffled array (6618268)
  • [0,1,...,n-1] (8cfcdf7)
  • A heuristics that numbers the permutation in the order of # of coming edges in the graph (d02968e)
@kyuridenamida
Copy link
Owner Author

kyuridenamida commented Sep 24, 2017

a random shuffled array vs [0,1,...,n-1]:
[0,1,...,n-1] is strong!
[0,1,...,n-1] vs the indegree strategy
It seems there's not so big difference. We would test in other cases than the current 100 cases.

Here's the result:
https://docs.google.com/spreadsheets/d/1-PTRg_Xf_O9qzIGzw3JzSuv0gfLR_74fFDSvBZ4VhoA/edit#gid=1075273413

@kyuridenamida
Copy link
Owner Author

The conclusion for this ticket is the initial solution is very important.

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

No branches or pull requests

1 participant