Thomas Christensen
Thomas Christensen
One API for this could be something like this: ```jl make_scratch(::typeof(algorithm), g::Graph) = (; scratch1 = ..., scratch2 = ...) ``` For any method depending on scratch space, a signature...
> * It will make maintaining this package more difficult. It will also make testing it more difficult. How will it become more difficult? > * Having no or very...
There's an implementation for `::Ray`, `::Box` [already](https://github.com/JuliaGeometry/Meshes.jl/blob/master/src/intersections/rays.jl), but not one for `Line`. A 3D implementation without branches is e.g. (just as scaffold, not in the Meshes.jl style): ```jl function intersects(b::Box,...
Maybe the cleanest current approach is to iterate over all partitions of shorter cardinality as well, i.e., something like: ```jl function partitions_include_empty(v, n) ps = Vector{Combinatorics.FixedSetPartitions{typeof(v)}}(undef, n) for (i, nᵢ)...
Timing-wise, `is_articulation(g, v)` appears to give a speed-up of about a factor of ~2 in cases I looked at, compared to `v ∈ articulation(g)`: ```jl julia> g = path_graph(5) julia>...