This was started during JuliaCon with @pszufe but I never finished it - it's a naive Graphs.jl directed graph implementation that uses Dagger to partition the graph.
@gdalle
Todo:
[x] Optimize add_vertices! implementation
[x] Add undirected graph support
[x] Add freeze for creating immutable DGraph
[x] Optimize immutable DGraph operations
[x] Default to directed graph
[x] Add vertex/edge metadata support
[x] Add lazy weights implementation (calls weights on metadata)
[x] Rename "external" to "background" for cross-partition AdjList
[x] Switch AdjList to dense representation (like SimpleGraph)
[x] Optimize purely local operations
[x] Validate Graphs.jl interface compatibility
[x] Return and cache neighborhood on remote vertex lookup (inneighbors/outneighbors)
This was started during JuliaCon with @pszufe but I never finished it - it's a naive Graphs.jl directed graph implementation that uses Dagger to partition the graph.
@gdalle
Todo:
add_vertices!implementationfreezefor creating immutableDGraphDGraphoperationsweightsimplementation (callsweightson metadata)AdjListAdjListto dense representation (likeSimpleGraph)inneighbors/outneighbors)SimpleGraphDataFrameor Tables source