Basic graph operations - Githubissues

AnacletoLAB / grape

🍇 GRAPE is a Rust/Python Graph Representation Learning library for Predictions and Evaluations

MIT License

502 stars 38 forks source link

Basic graph operations #60

Open chau25102001 opened 3 months ago

chau25102001 commented 3 months ago

Hi, thanks for your great work, I just got into GRAPE and I'm interesting in some basic graph operations, more specifically DFS, BFS, k-core, and connected component. But I'm getting a little bit lost in the code and the document is a quite fuzzy. Do you guys have any tutorials for those operations, please tell me. Thanks a lot!!!!

LucaCappelletti94 commented 3 months ago

Hi! Briefly:

Connected components: https://github.com/AnacletoLAB/grape/blob/main/tutorials/Billion-scale%20connected%20components%20with%20GRAPE.ipynb
DFS & BFS are not algorithms, but things used within algorithms. As such, while there are several algorithms using BFS, there isn't an algorithm called BFS available.
k-core is not available.