I'm not sure that what you need is Edmond's blossom algorithm. Maximum
matching is a problem on undirected graphs. Your problem seems to involve a
directed graph structure (A prefers B doesn't mean B prefers A).
Daniel Prager's solution involves randomization, so I think it's possible
that the
In regard to "non-commercial stuff that you're not ready to release" (I
have a lot of that), I believe GitHub requires a paid account to host
private repositories. (I'd be delighted to hear otherwise.) I host some of
my non-public code on BitBucket, which provides private repositories for
free. It
I like using GitHub for this (IIUC Bitbucket or GitLab would work equally well).
The Racket package catalog tracks a branch, say `master`. After you
push a commit to `master`, the rkt pkg cat will notice automatically.
It scans at intervals. (If you're impatient, sign in and choose
"Refresh my
I'm thinking of moving all my open source third-party Racket packages to
GitHub, and had some questions, for other third-party developers...
1. How do third-party developers of polished Racket packages like using
GitHub? (Example questions... What friction is there still, to rapidly
making a
4 matches
Mail list logo
