-
The type `GNNGraph` from [GraphNeuralNetworks.jl](https://github.com/CarloLucibello/GraphNeuralNetworks.jl) is a `Graphs.AbstractGraphs` and implements the corresponding interface, therefore it would …
-
At the moment, shortest path algorithms such as Dijkstra and A* rely on the standard `PriorityQueue` from [DataStructures.jl](https://www3.cs.stonybrook.edu/~rezaul/papers/TR-07-54.pdf), partly becaus…
-
When trying to install the package on Windows x64 (as a dependency to LightGraphExtras.jl), I get the following error:
```
julia> Pkg.add("LightGraphsExtras")
INFO: Cloning cache of BlossomV fro…
-
The idea here is to treat the graph matrix as a feature matrix and to use traditional dimension reduction/clustering techniques on these features.
An example workflow would be:
- build the sparse …
-
An issue came up in GraphPlot.jl that turns out to actually be an issue in Compose.jl (https://github.com/JuliaGraphs/GraphPlot.jl/issues/156)
MWE:
Make a plot with many red circles
```julia
n =…
-
Hi @filchristou, congrats on the release!
I wanted to give a few details regarding MetaGraphsNext, to help users make informed choices:
- In the latest versions, our wrapper is compatible with a…
-
**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 a cycle `u -> v -> u`. This behavior make…
-
I've written a simple implementation of the Kamada Kawai layout using Optim. Is there interest in a general inclusion? If so, I'll clean it up and put in a pull-request.
-
The set data structure could perhaps be changed to a SparseMatrix representation for AdjacencyMatrix?
Also `UniqueVectors.jl` could be potentially useful here.
https://github.com/zapatacomputin…
-
Since the adjacency matrix representation will be used primarily by people who are trying to do algebraic graph theory, it would make sense to not make a boolean array and rather actually make a float…