Reach feature parity with petgraph for 0.2 release

maminrayej commented 1 year ago

Tracking issue of list of features that needs to be implemented in order to reach feature parity with petgraph.

Algorithms

[ ] Find Negative Cycle
[ ] Feedback Arc Set
[ ] K Shortest Path
[ ] All Simple Paths
[ ] Dominators
[ ] Transitive Reduction
[ ] Condensation
[ ] Kosaraju SCC
[ ] Bipartite
[ ] Isomorphism
[ ] Matching (Maximal and Perfect)

Storage

[ ] Adjacency List
[ ] Adjacency Map
[ ] Adjacency Matrix
[ ] CSR

View

[x] Reverse View
[x] Complement View

IO

[ ] Graphviz Dot Format

0xForerunner commented 11 months ago

Hey! Commenting here because Id love to see some work done on this project. In particular I'm looking for the All Simple Paths algo. The Graph ecosystem in rust is in a pretty sad state at the moment, and I really love the layout and philosophy behind this project.

maminrayej commented 11 months ago

Hi @ewoolsey :) That's really great to hear. Thanks for your warm words.

To not repeat myself, I'll leave the link to my message here as context explaining the current design of the project, and why it's been some time since my last commit.

maminrayej / prepona