.

Author: kiyoon

README.md

@@ -1,4 +1,4 @@
-# fast-graph
+# rust-graph
 
 Graph algorithms implemented in Rust, available as a Python package.
 
@@ -7,13 +7,13 @@ So far, there is only one function implemented: `all_pairs_dijkstra_path_length`
 ## Installation
 
 ```bash
-pip install fast-graph
+pip install rust-graph
 ```
 
 ## Usage
 
 ```python
-from fast_graph import all_pairs_dijkstra_path_length
+from rust_graph import all_pairs_dijkstra_path_length
 
 weighted_edges = [
     (0, 1, 1.0),

pyproject.toml

@@ -3,9 +3,9 @@ requires = ["maturin>=1.5,<2.0"]
 build-backend = "maturin"
 
 [project]
-name = "fast-graph"
+name = "rust-graph"
 requires-python = ">=3.8"
-description = "Python project template" # OPTIONALLY CHANGE
+description = "Simple and fast graph operations written in Rust" # OPTIONALLY CHANGE
 authors = [
   { name = "Kiyoon Kim" }, # OPTIONALLY CHANGE
 ]
@@ -26,7 +26,7 @@ classifiers = [
 dynamic = ["version"]
 
 [project.urls]
-"Homepage" = "https://github.com/deargen/fast-graph"
+"Homepage" = "https://github.com/deargen/rust-graph"
 
 [tool.maturin]
 features = ["pyo3/extension-module"]
@@ -39,7 +39,7 @@ testpaths = ["tests"]
 [tool.ruff]
 src = ["src"]  # for ruff isort
 extend-exclude = [
-  "src/fast_graph/_version.py",  # CHANGE
+  "src/rust_graph/_version.py",  # CHANGE
 ]
 
 [tool.ruff.lint]
@@ -137,6 +137,6 @@ pythonPlatform = "Linux"
 
 [tool.coverage.report]
 omit = [
-  "src/fast_graph/_version.py", # CHANGE
+  "src/rust_graph/_version.py", # CHANGE
   # OPTIONALLY ADD MORE LATER
 ]

rust/Cargo.lock

@@ -1,10 +1,10 @@
 [package]
-name = "fast-graph"
+name = "rust-graph"
 version = "0.0.0"
 edition = "2021"
 
 [lib]
-name = "fast_graph"
+name = "rust_graph"
 crate-type = [ "cdylib", "rlib",]
 
 [dependencies]

rust/Cargo.toml

@@ -402,7 +402,7 @@ fn all_pairs_dijkstra_path_length(edges: Vec<(u32, u32, f64)>, cutoff: Option<f6
 
 /// A Python module implemented in Rust.
 #[pymodule]
-fn fast_graph(_py: Python, m: &Bound<'_, PyModule>) -> PyResult<()> {
+fn rust_graph(_py: Python, m: &Bound<'_, PyModule>) -> PyResult<()> {
     m.add_function(wrap_pyfunction!(all_pairs_dijkstra_path_length, m)?)?;
     Ok(())
 }

rust/src/lib.rs

@@ -1,6 +1,6 @@
 use std::collections::HashMap;
 
-use fast_graph::Graph;
+use rust_graph::Graph;
 
 #[test]
 fn test_dijkstra_singlesource() {

rust/tests/test_dijkstra.rs

@@ -7,7 +7,7 @@
 
 def main():
     snapshot_download(
-        repo_id="Deargen/fast-graph",
+        repo_id="Deargen/rust-graph",
         repo_type="dataset",
         revision="b30677dd3a76a0ecf51944861adacf433e9ecc04",
         local_dir="data",

scripts/hf_download.py

@@ -0,0 +1,5 @@
+from .rust_graph import *
+
+__doc__ = rust_graph.__doc__
+if hasattr(rust_graph, "__all__"):
+    __all__ = rust_graph.__all__

src/fast_graph/__init__.py

@@ -8,7 +8,7 @@
 import trimesh
 from scipy.sparse import coo_matrix, csr_matrix
 
-from fast_graph import all_pairs_dijkstra_path_length
+from rust_graph import all_pairs_dijkstra_path_length
 
 logger = logging.getLogger(__name__)