Simon Schölly
Simon Schölly
**Description of bug** `is_cyclic` does not behave as one would expect on undirected graphs, it seems as soon as there is an edge `u -- v` it thinks there is...
There are now quite a lot of packages on this list that have not been updated in many years and do not work on Julia >= v1.0 and also have...
Our tests currently almost everywhere use `SimpleGraph` and `SimpleDiGraph` for testing methods that work with `AbstractGraph` and `AbstractEege`.. This can lead to issues, when the methods under test relay on...
As mentioned in #88 , we should have some constructors that take an `AbstractGraph` and create a `SimpleGraph` or `SimpleDiGraph` from that. I.e. the functions that we need are: ```julia...
The documentation for `spring_layout`says, that the algorithm uses the the forces ``` Attractive force: f_a(d) = d^2 / k Repulsive force: f_r(d) = -k^2 / d ``` but what it...
There are large parts of the code that are not covered by tests. Furthermore, there should be tests special cases, such as graphs with 0, 1, 2 or three vertices,...
I have started working on a package called [GraphKernels.jl](https://github.com/simonschoelly/GraphKernels.jl), that implements kernel functions between graphs. So far I have deliberately used similar function names as this packge, for example `kernelmatrix`,...
It looks as if it is not possible to plot a graph without edges: ```julia julia> using LightGraphs, Plots, GraphRecipes julia> plot(SimpleGraph(5)) ERROR: ArgumentError: reducing over an empty collection is...
I noticed that edge attributes can be specified by a `Dict` but not an `AbstractDict`. Would it make sense to allow also `AbstractDict`? Then for example one could use `DefaultDict`...
I noticed that some methods for `IntDisjointSets` are defined such that they only allow the exact eltype as parameter, for example ```julia """ in_same_set(s::IntDisjointSet{T}, x::T, y::T) Returns `true` if `x`...