-
Replaced/duplicate implementations
- [ ] New Link Cut Tree implementation (this submission from NWERC has a [short one](https://ideone.com/EhActz))
- [x] Another simplex implementation (they're not …
-
- [x] Binary Search
- [x] Quicksort
- [x] Merge Sort
- [ ] Suffix Array
- [ ] Knuth-Morris-Pratt Algorithm (KMP)
- [ ] Rabin-Karp Algorithm
- [ ] Tries
- [ ] Depth First Traversal of a graph
- […
-
-
Currently, the minimum weight perfect matching (MWPM) algorithm relies on BlossomV.jl, a wrapper around Kolmogorov's BlossomV software, which has a research-only, non-commercial license. I'm wondering…
-
The main idea of the algorithm:
Start form any match.
1.Trying to find a path that could make the match larger by reversing the path.
2.If a path is found, reverse it, then goto 1.
3.Shuffle the …
-
Hi,
Thanks for this good library, I wanted to ask whether is there any repository or well known method for meshing a 2d region with quadrilaterals instead of triangles?
Thanks
-
As discussed at the October 2014 Madison ImgLib2 hackathon, we want to design a package for multithreading, which has an interface that specifies how multithreading is done. This would probably live i…
-
Does the plugin consider the sequence of home and away pairings ?
For example if the guy (chess) played with white then he plays white again and again.
![screenshot from 2018-05-17 21-30-30](https:/…
ghost updated
6 years ago
-
### What would you like to Propose?
Hey I saw a Feature Request for Edmond Algorithm and wanted to add another Algorithm - Edmonds Blossom Algorithm, under the data structure/graphs
The Edmonds …
-
Due to the length of the bristles (default brush), when the carriage lifts to reink, then sets the brush back down to complete a given line, you are left with a gap in the line that does not get paint…