Updated README.

TuGraph-family · Nov 26, 2024 · d65b2fb · d65b2fb
1 parent 051d63e
commit d65b2fb
Showing 1 changed file with 3 additions and 3 deletions.
diff --git a/procedures/community/README.md b/procedures/community/README.md
@@ -3,10 +3,10 @@
  In this directory, The procedures are contribution from the commmunity.
 
 ## K-hop Algorithm
-The K-hop algorithm is used to find all nodes within K hops from a given starting node in a graph. It is particularly useful in social network analysis, recommendation systems, and network topology analysis.
+ The K-hop algorithm is used to find all nodes within K hops from a given starting node in a graph. It is particularly useful in social network analysis, recommendation systems, and network topology analysis.
 
 ### Contributor
-This algorithm was contributed by AidenPearce-ZYQ, iwanttoknowwhy and ZhengHeber.
+ This algorithm was contributed by [Yingqi Zhao](https://github.com/AidenPearce-ZYQ), [Junjie Wang](https://github.com/iwanttoknowwhy) and [Haibo Zheng](https://github.com/ZhengHeber).
 
 ### Usage
-For detailed usage, please refer to the TuGraph-DB OLAP C++ API documentation and run khop_standalone --help.
+ For detailed usage, please refer to the TuGraph-DB OLAP C++ API documentation. After installation, you can run `khop_standalone --help` for additional information.