-
## DaggerGraphs
- https://github.com/JuliaParallel/Dagger.jl/pull/448
- Huge graphs with partitioned structure and metadata
- Merge is close thanks to @jpsamaroo
- Order of magnitude: hundreds o…
-
I believe after a bit more development we can make this package more public and might even join the JuliaGraphs organisation with it (?). In pronciple it is useful for various applications. In any cas…
-
MWE:
```jl
minimum_weight_perfect_matching(Graph([Edge(1,2)]), Dict(Edge(1,2)=>2.0))
ERROR: InexactError: trunc(Int32, NaN)
Stacktrace:
[1] trunc
@ ./float.jl:760 [inlined]
[2] round
…
-
Thanks for making a great package! Would it be possible to integrate this with the above two mentioned packages? I'm thinking that we then could write
```julia
gplot(g; layout=NetworkLayout:Stress…
ghost updated
2 years ago
-
Hi,
This is a sweet package, thanks for your hard work writing it. I had a couple questions/requests about looks,
1. It would be really awesome if the node/edge labels could be [LaTeXStrings](h…
-
I thought this should work, but it doesn't:
```julia
using Graphs
using MetaGraphs
g = path_graph(5)
mg = MetaGraph(g, 3.0)
set_prop!(mg, :description, "This is a metagraph.")
savegraph("…
-
If one has a weighted graph, would it make sense for the layout algorithm to account for the weights?
This is done in, for instance, the R package `qgraph`.
Perhaps I'm viewing this too simpli…
-
Splitting out GraphsBase.jl means deciding which functions
1. Have to be overridden by users (the "interface")
2. Rely on the interface while remaining reasonably basic (the "core")
3. Rely on the …
-
What breaking changes need to be made before we can release MetaGraphs version 1.0.0?
-
using LightGraphs, GraphPlot;
using Colors;
n = 198
graph = barabasi_albert(n, 3, 3)
mapping = ones(n)
mapping[1:100] .= 2
nodecolor = [colorant"green", colorant"red"]
nodefillc = nodecol…
hldwn updated
2 years ago