Alfredo Braunstein

> Currently, a `Distribution`, say `D`, is parameterized by a `F * `F` can be `Univariate`, `Multivariate`, or `Matrixvariate` > * `S` can be `Discrete` or `Continuous`. > > There's...

What about returning a named tuple instead of a custom struct?

Example 3 seems really a bug to me. The problem is that `iszero(missing)` is `missing` by JuliaLang/julia#31303, but the `SparseArrays` code is not prepared with this ternary "logic", i.e. it...

The twisted thing is that `missing == true` is `missing` so this doesn't help... EDIT: `if iszero(x) === true` would work, but I agree it would be (even more) ugly....

`SparseArrays`

The following code implements the good strategy above for (n,p) graphs. If there's interest I can prepare a PR. ```julia function trianglemap(r) j = floor(Int, (1+sqrt(8r-7))/2) + 1 i =...

I went ahead and opened https://github.com/JuliaGraphs/Graphs.jl/pull/212

> I added the implementation of @simonschoelly for `G(n, p)` graphs, and I implemented Vitter's algorithm for `G(n, m)` graphs. As was initiated in Simon's implementation, we can now allow...

The `IndexedGraphs` package looks relevant here :smile: EDIT: here's the link https://github.com/stecrotti/IndexedGraphs.jl

It's a miracle that tests have passed because some of them depend on the specific random instance (that surely changed)...