[feature][db] graph algorithm library rustworkx-core

[pinghe]

Could we integrate the crate graph algorithm library rustworkx-core to enhance the query functionality?

[michaelvlach]

Hi, the rustworkx-core seems to be tightly coupled to petgraph and does not seem to allow different graph implementations for their algorithms. What functionality specifically are you missing that rustworx-core provides?

[pinghe]

rustworkx-core is an extension library built on top of petgraph. petgraph provides core graph data structures and basic graph algorithms, while rustworkx-core adds additional algorithms and features on top of that. These primarily include Centrality, Connectivity, Shortest Path, Coloring, DAG, Traversal, Generators, and more.

The data structure of agdb only needs to implement necessary trait such as GraphBase and IntoNeighbors Etc. to utilize existing graph algorithms.

use petgraph::visit::{GraphBase, IntoNeighbors, Visitable, Data};  
  
impl GraphBase for YourGraphType {  
    type NodeId = YourNodeId;  
    type EdgeId = YourEdgeId;  
}  
  
impl IntoNeighbors for &YourGraphType {  
    type Neighbors = YourNeighborsIterator;  
    fn neighbors(self, n: Self::NodeId) -> Self::Neighbors {  
        // ...
    }  
}  

...

[michaelvlach]

I have looked into it and on the surface this looks doable. I will need to figure out how exactly to expose it. Currently I am thinking using a petgraph view wrapper implementing the traits as you mention and via the query system as extra algorithms besides the ones natively supported by agdb. Thanks for the suggestion.