High-performance graph algorithms optimized for Apple's MLX framework. Features random walks, biased random walks (Node2Vec), and neighbor sampling
-
Updated
Feb 11, 2026 - C++
High-performance graph algorithms optimized for Apple's MLX framework. Features random walks, biased random walks (Node2Vec), and neighbor sampling
Add a description, image, and links to the mlx-graphs topic page so that developers can more easily learn about it.
To associate your repository with the mlx-graphs topic, visit your repo's landing page and select "manage topics."