Improve performance of Hatchet Graphs using igraph #20
Labels
area-graphframe
Issues and PRs involving Hatchet's core GraphFrame datastructure and associated classes
type-feature
Requests for new features or PRs which implement new features
type-internal-cleanup
PR or issues related to the structure of the codebase, directories and refactors
type-question
Issues which are not directly requesting a bugfix or feature
While looking into C++ graph libraries for a personal project, I discovered the igraph library. It is a extremely versatile graph library that's written in C/C++ and has bindings to C, Python, R, etc.
Given that there have been performance concerns with respect to certain functionality in Hatchet's
Graph
class, I'm wondering if it would be possible to reimplement theGraph
class using the Python version ofigraph
.One thing to note, if we were to do this, the reimplementation would involve moving some functionality (e.g.,
traverse
,dag_equal
) out of theNode
class and into theGraph
class. This would technically be a backwards compatibility-breaking change to Hatchet's API.I'm opening this issue for discussion of the idea.
The text was updated successfully, but these errors were encountered: