Guillaume Dalle
Guillaume Dalle
Bumping this because of the issue above: should we move the repo inside the organization so that people can start contributing?
Hi there! Just following up, is your problem solved @Philogicatician ? Can we close the issue?
I made a small comparison of the implementation choices of various packages, hopefully this fuels the discussion: - SWG: [SimpleWeightedGraphs.jl](https://github.com/JuliaGraphs/SimpleWeightedGraphs.jl) - MG: [MetaGraphs.jl](https://github.com/JuliaGraphs/MetaGraphs.jl) - MGN: [MetaGraphsNext.jl](https://github.com/JuliaGraphs/MetaGraphsNext.jl) - SVG: [SimpleValueGraphs.jl](https://github.com/simonschoelly/SimpleValueGraphs.jl) -...
Agreed. I ported every open issue (I think you did the same for PRs?), but I didn't suspect there were interesting stale ones.
See also https://github.com/sbromberger/SimpleWeightedGraphs.jl/issues/72
@fieldofnodes
Another example of dynamic edge generation is https://github.com/gdalle/GridGraphs.jl
> I believe I would still need to specify the entire graph, before I pass the graph to the a_star method right? In that case yes, but a grid graph...
> To get astar to work with lazy graphs I have had to add some code in astar to expand the vectors used to keep track of information I'm not...
Okay, I had not understood what you meant by "lazy". - If the graph doesn't change, retrieving the neighbors lazily (with a function instead of a fixed container) is supported...