This issue will be used as a central place to gather graph algorithms that can/will be implemented in DuckPGQ (without sticking to a specific timeline). There are many graph algorithms, but there are probably too many to implement all of them. However, supporting a few would be a good start. We also have to see which algorithms can be efficiently executed using the CSR representation.
This issue will be used as a central place to gather graph algorithms that can/will be implemented in DuckPGQ (without sticking to a specific timeline). There are many graph algorithms, but there are probably too many to implement all of them. However, supporting a few would be a good start. We also have to see which algorithms can be efficiently executed using the CSR representation.
Path-finding:
Community Detection:
Label Propagation Algorithm - WikipediaCentrality Measures:
Matching and Flow:
Spectral Graph Theory:
Graph Embedding:
Miscellaneous: