update README

Author: MinLee0210

README.md

@@ -1,46 +1,60 @@
-
-# fastlap
+# **fastlap**
 
 **Python’s LAP (Linear Assignment Problem) solver — written in Rust for performance.**
 
-`fastlap` provides a blazing-fast implementation of common assignment algorithms such as:
+`fastlap` delivers a blazing-fast implementation of popular assignment algorithms, including:
 
-- Jonker-Volgenant (LAPJV)
-- Hungarian (a.k.a. Munkres)
+* **Jonker–Volgenant (LAPJV)**
+* **Hungarian (a.k.a. Munkres)**
+* **LAPMOD**
 
-Built with [Rust](https://www.rust-lang.org/) and exposed to Python via [PyO3](https://pyo3.rs), this library offers performance and interoperability in one package.
+Built with [Rust](https://www.rust-lang.org/) and exposed to Python via [PyO3](https://pyo3.rs), `fastlap` combines performance and interoperability in a single lightweight package.
 
 
-## ✨ Features
+## 📖 Algorithms
 
-- ✅ Fast and memory-safe implementation in Rust
-- ✅ Python bindings via PyO3
-- ✅ Supports both `lapjv` and `hungarian` algorithms
-- ✅ Can be used in native Rust projects or as a Python package
+* **LAPJV** — Efficient dual-based shortest augmenting path algorithm
+  *(Jonker & Volgenant, 1987)*
+* **Hungarian Algorithm** — Classic method using row/column reduction and assignment phases
+* **LAPMOD** — A modified variant for better performance under specific conditions
 
 
-## 📖 Algorithms
+## 🚀 Usage
 
-* **LAPJV** – Efficient dual-based shortest augmenting path algorithm (Jonker & Volgenant, 1987)
-* **Hungarian** – Classic method with row/column reduction and assignment phases
+```python
+import fastlap
 
-## Roadmap
+# Example cost matrix
+matrix = [
+    [1, 2, 3],
+    [4, 5, 6],
+    [7, 8, 9]
+]
 
-- [ ] Release first version
-- [ ] Add more algorithms
-- [ ] Add more features
-- [ ] Add more examples
-- [ ] Add more tests
-- [ ] Add more benchmarks
+# Solve the LAP using LAPJV algorithm
+cost, row_assign, col_assign = fastlap.solve_lap(matrix, method="lapjv")
 
+print("Total cost:", cost)
+print("Row assignments:", row_assign)
+print("Column assignments:", col_assign)
+```
 
-## 📚 References
 
-* Jonker, R., & Volgenant, A. (1987). *A shortest augmenting path algorithm for dense and sparse linear assignment problems*. Computing, 38(4), 325–340.
-* Munkres, J. (1957). *Algorithms for the Assignment and Transportation Problems*. Journal of the Society for Industrial and Applied Mathematics.
+## 📄 Citation
 
+If you use `fastlap` in your research or project, please cite the following:
+
+```
+@misc{fastlap2025,
+  author       = {Le Duc Minh},
+  title        = {fastlap: A Python LAP solver powered by Rust},
+  year         = {2025},
+  howpublished = {\url{https://github.com/8Opt/fastlap}},
+  note         = {Python-Rust LAP solver implementing LAPJV, Hungarian, and LAPMOD}
+}
+```
 
-## 📃 License
 
-MIT License © 2025
+## 📃 License
 
+**MIT License** © 2025 — use it freely in commercial or open-source projects.