Closed patricxu closed 3 years ago
GL aims for GNN instead of classical graph algorithms, such as PageRank. So we did not show examples in this field. GL abstracts a Partition-Process-Stitch
framework, which looks like Map-Reduce
and covers a lot of computing pattern. All of the Samplers
are implemented based on this framework. Maybe you can have a try.
It's worth a try!
Could you give us a few examples for the classical graph algorithms, such as Pagerank, LPA, WCC, etc.?