Graphs.jl
Graphs.jl copied to clipboard
An optimized graphs package for the Julia programming language
Hi there, I've been working with graph crossings and their properties and such. Originally I was using Networkx but I've been using Graphs.jl and Julia now. Some of the things...
Currently, many algorithms are not discoverable unless you know who created them. We should instead export more explicit function names, and add a type-based mechanism for dispatch with a reasonable...
Almost 80% of the time spent loading `Graphs.jl` is for loading `StaticArrays`. Manifest.toml shows that the dependency path is `QuantumDAGs` $\to$ `Graphs` $\to$ `ArnoldiMethod` $\to$ `StaticArrays`. `ArnoldiMethod` is imported into...
Inspired by this recent post: https://discourse.julialang.org/t/metatesting-jl-who-tests-the-test-suites/99273
Hi. I think it would be nice to define here these two interface functions. Some pseudocode: ```julia """ todirected(g::AbstractGraph) Create a directed instance of graph `g`. If `g` is already...
When writing code which mutates a graph instance multiple times, it quickly becomes very complicated to reason about which vertices after the deletion correspond to which vertices before. I believe...
Since the `AbstractEdge` type is part of the graphs interface, I think it would make sense to have something similar to `inneighbors`, `outneighbors` and `neighbors`, which behaves in pretty much...
`rem_vertices!` is $O(|V|)$ or worse. For example https://github.com/JuliaGraphs/Graphs.jl/blob/53cb58152a19ca62fa01439300948c30035dca6a/src/SimpleGraphs/simpledigraph.jl#L470 Here is another implementation. I've tested it a bit, but not thoroughly. It has different API than the current version. In fact...