From d65b2fb9a9171d323dcaa3c48b9e8357b5a49243 Mon Sep 17 00:00:00 2001 From: ZhaoYingqi Date: Tue, 26 Nov 2024 18:45:47 +0800 Subject: [PATCH] Updated README. --- procedures/community/README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/procedures/community/README.md b/procedures/community/README.md index 1b8ec99ae3..33adb89493 100644 --- 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. \ No newline at end of file + For detailed usage, please refer to the TuGraph-DB OLAP C++ API documentation. After installation, you can run `khop_standalone --help` for additional information. \ No newline at end of file