larsrh on master
Update cats-core, cats-laws to … Merge pull request #387 from sc… (compare)
larsrh on v0.9.2
larsrh on master
Setting version to 0.9.2 Setting version to 0.9.3-SNAPSH… (compare)
larsrh on master
Scala 3.0.0-RC2 support and sbt… (compare)
larsrh on gh-pages
updated site (compare)
larsrh on master
Add index.md to fix microsite 4… Merge pull request #386 from Vl… (compare)
larsrh on master
Update sbt to 1.5.0 Merge pull request #385 from sc… (compare)
Hi @stew , I perfectly understand how difficult is to maintain these projects, keep working and have some time to sleep ;-)
In relation to the toy, I have a couple of examples within DailyAlgorithm, they are quite self-contained: One is the Kruskal algorithm, the other is an algorithm to find the connected components in a graph. One or both these examples could be isolated into a single project which could use Scala.js to generate a live animation in the browser.
I've done that before, for other algorithms, and it is quite illustrative.
I don't currently use this structure in any project but I've used it to solve some Hackerrank and Codility problems.
I don't think it would be difficult to find projects using it, specially if they require use some sort of clusterization, net optimization, ... I could look around.
C++'s Boost library does provide Disjoint Sets: http://www.boost.org/doc/libs/1_64_0/libs/disjoint_sets/disjoint_sets.html
Hi @stew , At the end of the day it wasn't clear to me if any of the two examples I mentioned matched you idea of a toy to show when you should use Disjoint Sets.
Some simpler examples come to my mind:
Having a list of 1 to 1 friendship connections, find groups of friends is one.
Is this the kind of thing you've in mind?
OptionT
, ListT
...)