[ ] Lorenz84 is still shacky and may fail unexpectetly
[ ] We need a test for a really high dimensional system (to also test the sparse method). @awage has done some tests on Kuramoto oscillators. We should try to have the same test as the curve that @maximilian-gelbrecht computed with their method in the MCBB paper.
[x] There is a problem with printing. Even when show_progress=false the algorithm always prints the first attractors found. I do not understand why. I need some help here.
[ ] Allow the value of the basins fractions to be used as a matching possibility as well.
[x] IMPORTANT!!! Must ensure unique matching! Must ensure that if one attractor matches to attractor A, no other attractor can match to A ! ! ! I therefore need to re-think the minimal_distance_combinations function.
[ ] you cannot interrupt the process with Ctrl+C. (This was teh case before as well, has nothing to do with the new Continuation code). I do not know why the process cannot be interrupted with Ctrl+C and we need to completely close the Julia process itself. But that's another thing to fix.
[x] Make our own implementation of the source code of a sparse high dimensional array (it's the same as SparseArrayKit but also the way we compute histograms in Entropies.jl)
show_progress=falsethe algorithm always prints the first attractors found. I do not understand why. I need some help here.minimal_distance_combinationsfunction.