Python-EasyGraph 1.5.1__tar.gz → 1.5.2__tar.gz

{python_easygraph-1.5.1/Python_EasyGraph.egg-info → python_easygraph-1.5.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: Python-EasyGraph
-Version: 1.5.1
+Version: 1.5.2
 Summary: Easy Graph
 Home-page: https://github.com/easy-graph/Easy-Graph
 Author: Fudan DataNET Group
@@ -17,22 +17,22 @@ Classifier: Operating System :: OS Independent
 Requires-Python: >=3.8, <3.15
 Description-Content-Type: text/markdown
 License-File: LICENSE
-Requires-Dist: numpy>=1.23.1; python_version >= "3.10"
-Requires-Dist: numpy>=1.19.5; python_version >= "3.7" and python_version <= "3.14"
+Requires-Dist: numpy>=1.23; python_version < "3.14"
+Requires-Dist: numpy>=2.0; python_version >= "3.14"
 Requires-Dist: tqdm>=4.49.0
 Requires-Dist: joblib>=1.2.0
 Requires-Dist: six>=1.16.0
-Requires-Dist: numpy<2.0,>=1.18.5
-Requires-Dist: gensim>=4.2.0; python_version >= "3.8"
+Requires-Dist: gensim>=4.3.3; python_version < "3.14"
 Requires-Dist: progressbar33>=2.4
 Requires-Dist: scikit-learn<=1.0.2,>=0.24.0; python_version == "3.7"
-Requires-Dist: scikit-learn>=0.24.0; python_version >= "3.8"
+Requires-Dist: scikit-learn>=0.24.0; python_version >= "3.8" and python_version < "3.14"
 Requires-Dist: scipy<=1.7.3,>=1.5.0; python_version == "3.7"
-Requires-Dist: scipy>=1.8.0; python_version >= "3.8"
-Requires-Dist: statsmodels>=0.12.0; python_version >= "3.7"
+Requires-Dist: scipy>=1.8.0; python_version >= "3.8" and python_version < "3.14"
+Requires-Dist: statsmodels>=0.12.0; python_version >= "3.7" and python_version < "3.14"
 Requires-Dist: progressbar>=2.5
 Requires-Dist: nose>=0.10.1
 Requires-Dist: pandas<=1.1.5,>=1.0.1; python_version <= "3.7"
+Requires-Dist: pandas>=1.1.0; python_version >= "3.8" and python_version < "3.14"
 Requires-Dist: matplotlib
 Requires-Dist: requests
 Requires-Dist: optuna
@@ -100,21 +100,33 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 
 👉 For more details, please refer to its [documentation](https://easy-graph.github.io/docs/eggpu.html) page.
 
-# News
-- [09-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 900,000 downloads!
-- [07-27-2025] 🎉 We released EasyGraph 1.5! This version integrates the HWNN model and supports 11 representative network datasets.
+# 📢 EasyGraph News
+
+## 📣 Media & Press
+- [08-09-2025] [EasyHypergraph: Fast, Efficient Higher-Order Network Analysis](https://scienmag.com/easyhypergraph-fast-efficient-higher-order-network-analysis/)
+- [01-15-2025] [开放原子大赛OpenRank开源数字生态分析与应用创新大赛全国一等奖 (in Chinese)](https://mp.weixin.qq.com/s/e54JHaP2AAEUN3S8RZ-Y2g)
+- [01-07-2025] [计算机科学技术学院教授陈阳入选“2024中国开源先锋33人” (in Chinese)](https://news.fudan.edu.cn/2025/0107/c2463a143932/page.htm)
+- [12-04-2024] [国际开源基准委员会的"顶级开源证书" (in Chinese)](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)
+- [10-16-2024] [2023年度上海开源创新卓越成果奖 (in Chinese)](https://mp.weixin.qq.com/s/kO6Dpyolf74dlDvKuoLlJA)
+- [11-06-2023] [复旦大学陈阳Patterns：EasyGraph——面向多学科的高性能网络结构分析工具箱｜Cell Press论文速递 (in Chinese)](https://mp.weixin.qq.com/s/f2LCyQv1dYuquM_EfGX6Ow?poc_token=HBV092ijI2L534IrD0Jl_fnf3VjhX8UudcPFLH6b)
+- [11-04-2023] [EasyGraph：多功能、跨平台、高效率的跨学科网络分析库 (in Chinese)](https://swarma.org/?p=46252)
+
+## 🚀 Releases & Milestones
+- [10-11-2025] EasyGraph **v1.5.1** released (Python 3.14 supported)
+- 🎉 **[09-29-2025] 900K+ Downloads! Thanks to our amazing community!**
+- [07-27-2025] EasyGraph **v1.5** released (This version integrates the HWNN model and supports 11 representative network datasets)
+- 🎉 **[06-29-2025] 800K+ Downloads!**
+- [11-22-2024] EasyGraph **v1.4.1** released (Python 3.13 supported)
+- [09-20-2024] EasyGraph **v1.4** released (GPU-powered functions for large network analysis)  
+- [05-27-2024] EasyGraph **v1.3** released (issues related to hypergraph analysis and visualization resolved)  
+- [04-09-2024] EasyGraph **v1.2** released (Python 3.12 supported)  
+- [02-05-2024] EasyGraph **v1.1** released (hypergraph analysis and learning for higher-order networks)  
+- [08-17-2023] EasyGraph **v1.0** released  
+- [07-22-2020] EasyGraph **first public release**
+
+## 📈 Publications
 - [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)! [[PDF](https://www.nature.com/articles/s41599-025-05180-5)]
-- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council! [[Certificate](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)]
-- [11-22-2024] We released EasyGraph 1.4.1! This version now fully supports Python 3.13.
-- [09-27-2024] 🎉 EasyGraph has reached 500,000 downloads!
-- [09-20-2024] We released EasyGraph 1.4! This version features GPU-powered functions for efficient large network analysis.
-- [05-27-2024] We released EasyGraph 1.3! This version has resolved several issues related to hypergraph analysis and visualization.
-- [04-09-2024] We released EasyGraph 1.2! This version now fully supports Python 3.12.
-- [03-06-2024] 🎉 We received the Shanghai Open Source Innovation Outstanding Achievement Award (Grand Prize)! [News](https://news.fudan.edu.cn/2024/0401/c2463a139799/page.htm)
-- [02-05-2024] We released EasyGraph 1.1! This version features hypergraph analysis and learning for higher-order network modeling and representation.
-- [08-17-2023] We released EasyGraph 1.0!
 - [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)! [[PDF](https://www.sciencedirect.com/science/article/pii/S2666389923002180)]
-- [07-22-2020] First public release of EasyGraph!
 
 # Stargazers
 
@@ -127,7 +139,7 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 
 ## Supported Versions
 
-``3.8 <= Python <= 3.13`` is required.
+``3.8 <= Python <= 3.14`` is required.
 
 ## Installation With pip
 ```

{python_easygraph-1.5.1 → python_easygraph-1.5.2/Python_EasyGraph.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: Python-EasyGraph
-Version: 1.5.1
+Version: 1.5.2
 Summary: Easy Graph
 Home-page: https://github.com/easy-graph/Easy-Graph
 Author: Fudan DataNET Group
@@ -17,22 +17,22 @@ Classifier: Operating System :: OS Independent
 Requires-Python: >=3.8, <3.15
 Description-Content-Type: text/markdown
 License-File: LICENSE
-Requires-Dist: numpy>=1.23.1; python_version >= "3.10"
-Requires-Dist: numpy>=1.19.5; python_version >= "3.7" and python_version <= "3.14"
+Requires-Dist: numpy>=1.23; python_version < "3.14"
+Requires-Dist: numpy>=2.0; python_version >= "3.14"
 Requires-Dist: tqdm>=4.49.0
 Requires-Dist: joblib>=1.2.0
 Requires-Dist: six>=1.16.0
-Requires-Dist: numpy<2.0,>=1.18.5
-Requires-Dist: gensim>=4.2.0; python_version >= "3.8"
+Requires-Dist: gensim>=4.3.3; python_version < "3.14"
 Requires-Dist: progressbar33>=2.4
 Requires-Dist: scikit-learn<=1.0.2,>=0.24.0; python_version == "3.7"
-Requires-Dist: scikit-learn>=0.24.0; python_version >= "3.8"
+Requires-Dist: scikit-learn>=0.24.0; python_version >= "3.8" and python_version < "3.14"
 Requires-Dist: scipy<=1.7.3,>=1.5.0; python_version == "3.7"
-Requires-Dist: scipy>=1.8.0; python_version >= "3.8"
-Requires-Dist: statsmodels>=0.12.0; python_version >= "3.7"
+Requires-Dist: scipy>=1.8.0; python_version >= "3.8" and python_version < "3.14"
+Requires-Dist: statsmodels>=0.12.0; python_version >= "3.7" and python_version < "3.14"
 Requires-Dist: progressbar>=2.5
 Requires-Dist: nose>=0.10.1
 Requires-Dist: pandas<=1.1.5,>=1.0.1; python_version <= "3.7"
+Requires-Dist: pandas>=1.1.0; python_version >= "3.8" and python_version < "3.14"
 Requires-Dist: matplotlib
 Requires-Dist: requests
 Requires-Dist: optuna
@@ -100,21 +100,33 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 
 👉 For more details, please refer to its [documentation](https://easy-graph.github.io/docs/eggpu.html) page.
 
-# News
-- [09-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 900,000 downloads!
-- [07-27-2025] 🎉 We released EasyGraph 1.5! This version integrates the HWNN model and supports 11 representative network datasets.
+# 📢 EasyGraph News
+
+## 📣 Media & Press
+- [08-09-2025] [EasyHypergraph: Fast, Efficient Higher-Order Network Analysis](https://scienmag.com/easyhypergraph-fast-efficient-higher-order-network-analysis/)
+- [01-15-2025] [开放原子大赛OpenRank开源数字生态分析与应用创新大赛全国一等奖 (in Chinese)](https://mp.weixin.qq.com/s/e54JHaP2AAEUN3S8RZ-Y2g)
+- [01-07-2025] [计算机科学技术学院教授陈阳入选“2024中国开源先锋33人” (in Chinese)](https://news.fudan.edu.cn/2025/0107/c2463a143932/page.htm)
+- [12-04-2024] [国际开源基准委员会的"顶级开源证书" (in Chinese)](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)
+- [10-16-2024] [2023年度上海开源创新卓越成果奖 (in Chinese)](https://mp.weixin.qq.com/s/kO6Dpyolf74dlDvKuoLlJA)
+- [11-06-2023] [复旦大学陈阳Patterns：EasyGraph——面向多学科的高性能网络结构分析工具箱｜Cell Press论文速递 (in Chinese)](https://mp.weixin.qq.com/s/f2LCyQv1dYuquM_EfGX6Ow?poc_token=HBV092ijI2L534IrD0Jl_fnf3VjhX8UudcPFLH6b)
+- [11-04-2023] [EasyGraph：多功能、跨平台、高效率的跨学科网络分析库 (in Chinese)](https://swarma.org/?p=46252)
+
+## 🚀 Releases & Milestones
+- [10-11-2025] EasyGraph **v1.5.1** released (Python 3.14 supported)
+- 🎉 **[09-29-2025] 900K+ Downloads! Thanks to our amazing community!**
+- [07-27-2025] EasyGraph **v1.5** released (This version integrates the HWNN model and supports 11 representative network datasets)
+- 🎉 **[06-29-2025] 800K+ Downloads!**
+- [11-22-2024] EasyGraph **v1.4.1** released (Python 3.13 supported)
+- [09-20-2024] EasyGraph **v1.4** released (GPU-powered functions for large network analysis)  
+- [05-27-2024] EasyGraph **v1.3** released (issues related to hypergraph analysis and visualization resolved)  
+- [04-09-2024] EasyGraph **v1.2** released (Python 3.12 supported)  
+- [02-05-2024] EasyGraph **v1.1** released (hypergraph analysis and learning for higher-order networks)  
+- [08-17-2023] EasyGraph **v1.0** released  
+- [07-22-2020] EasyGraph **first public release**
+
+## 📈 Publications
 - [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)! [[PDF](https://www.nature.com/articles/s41599-025-05180-5)]
-- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council! [[Certificate](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)]
-- [11-22-2024] We released EasyGraph 1.4.1! This version now fully supports Python 3.13.
-- [09-27-2024] 🎉 EasyGraph has reached 500,000 downloads!
-- [09-20-2024] We released EasyGraph 1.4! This version features GPU-powered functions for efficient large network analysis.
-- [05-27-2024] We released EasyGraph 1.3! This version has resolved several issues related to hypergraph analysis and visualization.
-- [04-09-2024] We released EasyGraph 1.2! This version now fully supports Python 3.12.
-- [03-06-2024] 🎉 We received the Shanghai Open Source Innovation Outstanding Achievement Award (Grand Prize)! [News](https://news.fudan.edu.cn/2024/0401/c2463a139799/page.htm)
-- [02-05-2024] We released EasyGraph 1.1! This version features hypergraph analysis and learning for higher-order network modeling and representation.
-- [08-17-2023] We released EasyGraph 1.0!
 - [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)! [[PDF](https://www.sciencedirect.com/science/article/pii/S2666389923002180)]
-- [07-22-2020] First public release of EasyGraph!
 
 # Stargazers
 
@@ -127,7 +139,7 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 
 ## Supported Versions
 
-``3.8 <= Python <= 3.13`` is required.
+``3.8 <= Python <= 3.14`` is required.
 
 ## Installation With pip
 ```

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/Python_EasyGraph.egg-info/SOURCES.txt

@@ -162,12 +162,14 @@ easygraph/functions/centrality/tests/test_pagerank.py
 easygraph/functions/community/LPA.py
 easygraph/functions/community/__init__.py
 easygraph/functions/community/ego_graph.py
+easygraph/functions/community/localsearch.py
 easygraph/functions/community/louvain.py
 easygraph/functions/community/modularity.py
 easygraph/functions/community/modularity_max_detection.py
 easygraph/functions/community/motif.py
 easygraph/functions/community/tests/__init__.py
 easygraph/functions/community/tests/test_LPA.py
+easygraph/functions/community/tests/test_LS.py
 easygraph/functions/community/tests/test_ego_graph.py
 easygraph/functions/community/tests/test_louvian.py
 easygraph/functions/community/tests/test_modularity.py

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/Python_EasyGraph.egg-info/requires.txt

@@ -1,7 +1,6 @@
 tqdm>=4.49.0
 joblib>=1.2.0
 six>=1.16.0
-numpy<2.0,>=1.18.5
 progressbar33>=2.4
 progressbar>=2.5
 nose>=0.10.1
@@ -9,6 +8,10 @@ matplotlib
 requests
 optuna
 
+[:python_version < "3.14"]
+numpy>=1.23
+gensim>=4.3.3
+
 [:python_version <= "3.7"]
 pandas<=1.1.5,>=1.0.1
 
@@ -16,16 +19,13 @@ pandas<=1.1.5,>=1.0.1
 scikit-learn<=1.0.2,>=0.24.0
 scipy<=1.7.3,>=1.5.0
 
-[:python_version >= "3.10"]
-numpy>=1.23.1
+[:python_version >= "3.14"]
+numpy>=2.0
 
-[:python_version >= "3.7"]
+[:python_version >= "3.7" and python_version < "3.14"]
 statsmodels>=0.12.0
 
-[:python_version >= "3.7" and python_version <= "3.14"]
-numpy>=1.19.5
-
-[:python_version >= "3.8"]
-gensim>=4.2.0
+[:python_version >= "3.8" and python_version < "3.14"]
 scikit-learn>=0.24.0
 scipy>=1.8.0
+pandas>=1.1.0

python_easygraph-1.5.2/Python_EasyGraph.egg-info/top_level.txt

@@ -0,0 +1,2 @@
+cpp_easygraph
+easygraph

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/README.md

@@ -51,21 +51,33 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 
 👉 For more details, please refer to its [documentation](https://easy-graph.github.io/docs/eggpu.html) page.
 
-# News
-- [09-29-2025] 🎉 Thanks to our amazing community! EasyGraph has reached 900,000 downloads!
-- [07-27-2025] 🎉 We released EasyGraph 1.5! This version integrates the HWNN model and supports 11 representative network datasets.
+# 📢 EasyGraph News
+
+## 📣 Media & Press
+- [08-09-2025] [EasyHypergraph: Fast, Efficient Higher-Order Network Analysis](https://scienmag.com/easyhypergraph-fast-efficient-higher-order-network-analysis/)
+- [01-15-2025] [开放原子大赛OpenRank开源数字生态分析与应用创新大赛全国一等奖 (in Chinese)](https://mp.weixin.qq.com/s/e54JHaP2AAEUN3S8RZ-Y2g)
+- [01-07-2025] [计算机科学技术学院教授陈阳入选“2024中国开源先锋33人” (in Chinese)](https://news.fudan.edu.cn/2025/0107/c2463a143932/page.htm)
+- [12-04-2024] [国际开源基准委员会的"顶级开源证书" (in Chinese)](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)
+- [10-16-2024] [2023年度上海开源创新卓越成果奖 (in Chinese)](https://mp.weixin.qq.com/s/kO6Dpyolf74dlDvKuoLlJA)
+- [11-06-2023] [复旦大学陈阳Patterns：EasyGraph——面向多学科的高性能网络结构分析工具箱｜Cell Press论文速递 (in Chinese)](https://mp.weixin.qq.com/s/f2LCyQv1dYuquM_EfGX6Ow?poc_token=HBV092ijI2L534IrD0Jl_fnf3VjhX8UudcPFLH6b)
+- [11-04-2023] [EasyGraph：多功能、跨平台、高效率的跨学科网络分析库 (in Chinese)](https://swarma.org/?p=46252)
+
+## 🚀 Releases & Milestones
+- [10-11-2025] EasyGraph **v1.5.1** released (Python 3.14 supported)
+- 🎉 **[09-29-2025] 900K+ Downloads! Thanks to our amazing community!**
+- [07-27-2025] EasyGraph **v1.5** released (This version integrates the HWNN model and supports 11 representative network datasets)
+- 🎉 **[06-29-2025] 800K+ Downloads!**
+- [11-22-2024] EasyGraph **v1.4.1** released (Python 3.13 supported)
+- [09-20-2024] EasyGraph **v1.4** released (GPU-powered functions for large network analysis)  
+- [05-27-2024] EasyGraph **v1.3** released (issues related to hypergraph analysis and visualization resolved)  
+- [04-09-2024] EasyGraph **v1.2** released (Python 3.12 supported)  
+- [02-05-2024] EasyGraph **v1.1** released (hypergraph analysis and learning for higher-order networks)  
+- [08-17-2023] EasyGraph **v1.0** released  
+- [07-22-2020] EasyGraph **first public release**
+
+## 📈 Publications
 - [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)! [[PDF](https://www.nature.com/articles/s41599-025-05180-5)]
-- [12-04-2024] 🎉 We received the "Top Open Source Certificate" by International Open Benchmark Council! [[Certificate](https://chenyang03.wordpress.com/wp-content/uploads/2025/07/image.png?w=1024)]
-- [11-22-2024] We released EasyGraph 1.4.1! This version now fully supports Python 3.13.
-- [09-27-2024] 🎉 EasyGraph has reached 500,000 downloads!
-- [09-20-2024] We released EasyGraph 1.4! This version features GPU-powered functions for efficient large network analysis.
-- [05-27-2024] We released EasyGraph 1.3! This version has resolved several issues related to hypergraph analysis and visualization.
-- [04-09-2024] We released EasyGraph 1.2! This version now fully supports Python 3.12.
-- [03-06-2024] 🎉 We received the Shanghai Open Source Innovation Outstanding Achievement Award (Grand Prize)! [News](https://news.fudan.edu.cn/2024/0401/c2463a139799/page.htm)
-- [02-05-2024] We released EasyGraph 1.1! This version features hypergraph analysis and learning for higher-order network modeling and representation.
-- [08-17-2023] We released EasyGraph 1.0!
 - [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)! [[PDF](https://www.sciencedirect.com/science/article/pii/S2666389923002180)]
-- [07-22-2020] First public release of EasyGraph!
 
 # Stargazers
 
@@ -78,7 +90,7 @@ It bridges the gap between EasyGraph and higher-order relationships. EasyHypergr
 
 ## Supported Versions
 
-``3.8 <= Python <= 3.13`` is required.
+``3.8 <= Python <= 3.14`` is required.
 
 ## Installation With pip
 ```

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/cpp_easygraph/common/utils.cpp

@@ -32,7 +32,7 @@ Graph_L graph_to_linkgraph(Graph &G, bool if_directed, std::string weight_key, b
     const std::vector<graph_edge>& edges = G._get_edges(if_directed);
     int edges_num = edges.size();
     Graph_L G_l(node_num, if_directed, is_deg);
-	for(register int i = 0; i < edges_num; i++){
+	for(int i = 0; i < edges_num; i++){
 			graph_edge e = edges[i];
 			edge_attr_dict_factory& edge_attr = e.attr;
 			weight_t edge_weight = edge_attr.find(weight_key) != edge_attr.end() ? edge_attr[weight_key] : 1;
@@ -42,7 +42,7 @@ Graph_L graph_to_linkgraph(Graph &G, bool if_directed, std::string weight_key, b
 			G_l.add_weighted_edge(e.u, e.v, edge_weight);
 			if (!if_directed){
 				G_l.add_weighted_edge(e.v, e.u, edge_weight);
-			}  
+			}
 	}
     return G_l;
-}
+}

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/cpp_easygraph/functions/centrality/betweenness.cpp

@@ -25,11 +25,11 @@ void betweenness_dijkstra(const Graph_L& G_l, const int &S, std::vector<double>&
     std::vector<double> delta(N+1, 0);
     std::vector<LinkEdge> E_path(edges_num+1);
     head_path[S] = 0;
-    dis[S] = 0; 
-    count_path[S] = 1; 
+    dis[S] = 0;
+    count_path[S] = 1;
     segment_tree_zkw.change(S, 0);
     int cnt_St = 0;
-   
+
     while(segment_tree_zkw.t[1] != dis_inf) {
         int u = segment_tree_zkw.num[1];
         if(u==0) break;
@@ -37,15 +37,15 @@ void betweenness_dijkstra(const Graph_L& G_l, const int &S, std::vector<double>&
         if (cutoff >= 0 && dis[u] > cutoff){
             continue;
         }
-        St[cnt_St++] = u;        
+        St[cnt_St++] = u;
         for(int p = head[u]; p != -1; p = E[p].next) {
             int v = E[p].to;
             if(cutoff >= 0 && (dis[u] + E[p].w) > cutoff){
                 continue;
             }
             if (dis[v] > dis[u] + E[p].w) {
-                dis[v] = dis[u] + E[p].w;  
-                segment_tree_zkw.change(v, dis[v]);    
+                dis[v] = dis[u] + E[p].w;
+                segment_tree_zkw.change(v, dis[v]);
                 count_path[v] = count_path[u];
                 head_path[v] = 0;
                 E_path[++edge_number_path].next = head_path[v];
@@ -57,7 +57,7 @@ void betweenness_dijkstra(const Graph_L& G_l, const int &S, std::vector<double>&
                 E_path[++edge_number_path].next = head_path[v];
                 E_path[edge_number_path].to = u;
                 head_path[v] = edge_number_path;
-                
+
             }
         }
     }
@@ -105,8 +105,8 @@ static double calc_scale(int len_V, int is_directed, int normalized, int endpoin
 
 
 
-static py::object invoke_cpp_betweenness_centrality(py::object G, py::object weight, 
-                                    py::object cutoff, py::object sources, 
+static py::object invoke_cpp_betweenness_centrality(py::object G, py::object weight,
+                                    py::object cutoff, py::object sources,
                                     py::object normalized, py::object endpoints){
     Graph& G_ = G.cast<Graph&>();
     int cutoff_ = -1;
@@ -134,7 +134,7 @@ static py::object invoke_cpp_betweenness_centrality(py::object G, py::object wei
     if(!sources.is_none()){
         py::list sources_list = py::list(sources);
         int sources_list_len = py::len(sources_list);
-        for(register int i = 0; i < sources_list_len; i++){
+        for(int i = 0; i < sources_list_len; i++){
             if(G_.node_to_id.attr("get")(sources_list[i],py::none()).is_none()){
                 printf("The node should exist in the graph!");
                 return py::none();
@@ -163,7 +163,7 @@ static py::object invoke_cpp_betweenness_centrality(py::object G, py::object wei
 
 
 #ifdef EASYGRAPH_ENABLE_GPU
-static py::object invoke_gpu_betweenness_centrality(py::object G, py::object weight, 
+static py::object invoke_gpu_betweenness_centrality(py::object G, py::object weight,
                         py::object py_sources, py::object normalized, py::object endpoints) {
     Graph& G_ = G.cast<Graph&>();
     if (weight.is_none()) {
@@ -174,12 +174,12 @@ static py::object invoke_gpu_betweenness_centrality(py::object G, py::object wei
     auto csr_graph = G_.csr_graph;
     std::vector<int>& E = csr_graph->E;
     std::vector<int>& V = csr_graph->V;
-    std::vector<double> *W_p = weight.is_none() ? &(csr_graph->unweighted_W) 
+    std::vector<double> *W_p = weight.is_none() ? &(csr_graph->unweighted_W)
                                 : csr_graph->W_map.find(weight_to_string(weight))->second.get();
     auto sources = G_.gen_CSR_sources(py_sources);
     std::vector<double> BC;
     bool is_directed = G.attr("is_directed")().cast<bool>();
-    int gpu_r = gpu_easygraph::betweenness_centrality(V, E, *W_p, *sources, 
+    int gpu_r = gpu_easygraph::betweenness_centrality(V, E, *W_p, *sources,
                                     is_directed, normalized.cast<py::bool_>(),
                                     endpoints.cast<py::bool_>(), BC);
 
@@ -196,7 +196,7 @@ static py::object invoke_gpu_betweenness_centrality(py::object G, py::object wei
 #endif
 
 
-py::object betweenness_centrality(py::object G, py::object weight, py::object cutoff, py::object sources, 
+py::object betweenness_centrality(py::object G, py::object weight, py::object cutoff, py::object sources,
                                     py::object normalized, py::object endpoints) {
 #ifdef EASYGRAPH_ENABLE_GPU
     return invoke_gpu_betweenness_centrality(G, weight, sources, normalized, endpoints);
@@ -212,7 +212,7 @@ py::object betweenness_centrality(py::object G, py::object weight, py::object cu
 //     std::vector<double> dis(N+1, INFINITY);
 //     std::vector<bool> vis(N+1, false);
 //     std::vector<int> head_path(N+1, 0);
-    
+
 //     const std::vector<int>& head = G_l.head;
 //     const std::vector<LinkEdge>& E = G_l.edges;
 //     int edges_num = E.size();
@@ -220,10 +220,10 @@ py::object betweenness_centrality(py::object G, py::object weight, py::object cu
 //     std::vector<long long> count_path(N+1, 0);
 //     std::vector<double> delta(N+1, 0);
 //     std::vector<LinkEdge> E_path(edges_num+1);
-    
+
 //     head_path[S] = 0;
-//     dis[S] = 0; 
-//     count_path[S] = 1; 
+//     dis[S] = 0;
+//     count_path[S] = 1;
 //     q.push(compare_node(S, 0));
 //     int cnt_St = 0;
 //     while(!q.empty()) {
@@ -250,14 +250,14 @@ py::object betweenness_centrality(py::object G, py::object weight, py::object cu
 //                 E_path[++edge_number_path].next = head_path[v];
 //                 E_path[edge_number_path].to = u;
 //                 head_path[v] = edge_number_path;
-                
+
 //             }
 //             else if (dis[v] == dis[u] + E[p].w) {
 //                 count_path[v] += count_path[u];
 //                 E_path[++edge_number_path].next = head_path[v];
 //                 E_path[edge_number_path].to = u;
 //                 head_path[v] = edge_number_path;
-                
+
 //             }
 //         }
 //     }

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/cpp_easygraph/functions/centrality/closeness.cpp

@@ -18,7 +18,7 @@ double closeness_dijkstra(const Graph_L& G_l, const int &S, int cutoff, Segment_
     const std::vector<int>& head = G_l.head;
     int number_connected = 0;
     long long sum_dis = 0;
-    dis[S] = 0; 
+    dis[S] = 0;
     segment_tree_zkw.change(S, 0);
     while(segment_tree_zkw.t[1] != dis_inf) {
         int u = segment_tree_zkw.num[1];
@@ -26,17 +26,17 @@ double closeness_dijkstra(const Graph_L& G_l, const int &S, int cutoff, Segment_
         segment_tree_zkw.change(u, dis_inf);
         if (cutoff >= 0 && dis[u] > cutoff){
             continue;
-        } 
+        }
         number_connected += 1;
         sum_dis += dis[u];
-        for(register int p = head[u]; p != -1; p = E[p].next) {
+        for(int p = head[u]; p != -1; p = E[p].next) {
             int v = E[p].to;
             if(cutoff >= 0 && (dis[u] + E[p].w) > cutoff){
                 continue;
             }
             if (dis[v] > dis[u] + E[p].w) {
                 dis[v] = dis[u] + E[p].w;
-                segment_tree_zkw.change(v, dis[v]);  
+                segment_tree_zkw.change(v, dis[v]);
             }
         }
     }
@@ -44,10 +44,10 @@ double closeness_dijkstra(const Graph_L& G_l, const int &S, int cutoff, Segment_
         return 0.0;
     else
         return 1.0 * (number_connected - 1) * (number_connected - 1) / ((N - 1) * sum_dis);
-    
+
 }
 
-static py::object invoke_cpp_closeness_centrality(py::object G, py::object weight, 
+static py::object invoke_cpp_closeness_centrality(py::object G, py::object weight,
                                             py::object cutoff, py::object sources) {
     Graph& G_ = G.cast<Graph&>();
     int N = G_.node.size();
@@ -63,7 +63,7 @@ static py::object invoke_cpp_closeness_centrality(py::object G, py::object weigh
     if(!sources.is_none()){
         py::list sources_list = py::list(sources);
         int sources_list_len = py::len(sources_list);
-        for(register int i = 0; i < sources_list_len; i++){
+        for(int i = 0; i < sources_list_len; i++){
             if(G_.node_to_id.attr("get")(sources_list[i],py::none()).is_none()){
                 printf("The node should exist in the graph!");
                 return py::none();
@@ -74,7 +74,7 @@ static py::object invoke_cpp_closeness_centrality(py::object G, py::object weigh
         }
     }
     else{
-        for(register int i = 1; i <= N; i++){
+        for(int i = 1; i <= N; i++){
             float res = closeness_dijkstra(G_l, i, cutoff_,segment_tree_zkw);
             CC.push_back(res);
         }
@@ -96,7 +96,7 @@ static py::object invoke_gpu_closeness_centrality(py::object G, py::object weigh
     auto csr_graph = G_.csr_graph;
     std::vector<int>& E = csr_graph->E;
     std::vector<int>& V = csr_graph->V;
-    std::vector<double> *W_p = weight.is_none() ? &(csr_graph->unweighted_W) 
+    std::vector<double> *W_p = weight.is_none() ? &(csr_graph->unweighted_W)
                                 : csr_graph->W_map.find(weight_to_string(weight))->second.get();
     auto sources = G_.gen_CSR_sources(py_sources);
     std::vector<double> CC;
@@ -120,4 +120,4 @@ py::object closeness_centrality(py::object G, py::object weight, py::object cuto
 #else
     return invoke_cpp_closeness_centrality(G, weight, cutoff, sources);
 #endif
-}
+}

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/cpp_easygraph/functions/cores/k_cores.cpp

@@ -51,7 +51,7 @@ py::object invoke_cpp_core_decomposition(py::object G) {
     for(int i = 1; i <= N; ++i){
         int v = vert[i];
         core[v] = deg[v];
-        for(register int p = head[v]; p!=-1; p = edges[p].next){
+        for(int p = head[v]; p!=-1; p = edges[p].next){
             int u = edges[p].to;
             if (deg[u] > deg[v]) {
                 int w = vert[bin[deg[u]]];
@@ -98,4 +98,4 @@ py::object core_decomposition(py::object G) {
 #else
     return invoke_cpp_core_decomposition(G);
 #endif
-}
+}

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/cpp_easygraph/functions/path/path.cpp

@@ -27,15 +27,15 @@ std::vector<float> _dijkstra(Graph_L &G_l, int source, std::string weight, int t
         if(u == target){
             break;
         }
-        for(register int p = head[u]; p != -1; p = E[p].next) {
+        for(int p = head[u]; p != -1; p = E[p].next) {
             int v = E[p].to;
             if (dis[v] > dis[u] + E[p].w) {
                 dis[v] = dis[u] + E[p].w;
-                segment_tree_zkw.change(v, dis[v]);  
-            }   
+                segment_tree_zkw.change(v, dis[v]);
+            }
         }
     }
-    
+
     return dis;
 
 }
@@ -54,14 +54,14 @@ py::object _invoke_cpp_dijkstra_multisource(py::object G,py::object sources, py:
     else{
         G_l = G_.linkgraph_structure;
     }
-    
+
 
     int N = G_l.n;
     py::list sources_list = py::list(sources);
     int sources_list_len = py::len(sources_list);
     std::vector<double> sssp;
-    for(register int i = 0; i < sources_list_len; i++){
-        if(G_.node_to_id.attr("get")(sources_list[i],py::none()) == py::none()){
+    for(int i = 0; i < sources_list_len; i++){
+        if(G_.node_to_id.attr("get")(sources_list[i],py::none()).is(py::none())){
             printf("The node should exist in the graph!");
             return py::none();
         }
@@ -88,12 +88,12 @@ py::object _invoke_gpu_dijkstra_multisource(py::object G,py::object py_sources,
     auto csr_graph = G_.csr_graph;
     std::vector<int>& E = csr_graph->E;
     std::vector<int>& V = csr_graph->V;
-    std::vector<double> *W_p = weight.is_none() ? &(csr_graph->unweighted_W) 
+    std::vector<double> *W_p = weight.is_none() ? &(csr_graph->unweighted_W)
                                 : csr_graph->W_map.find(weight_to_string(weight))->second.get();
     auto sources = G_.gen_CSR_sources(py_sources);
     std::vector<double> sssp;
-    int gpu_r = gpu_easygraph::sssp_dijkstra(V, E, *W_p, *sources, 
-                                            target.is_none() ? -1 : (int)py::cast<py::int_>(target), 
+    int gpu_r = gpu_easygraph::sssp_dijkstra(V, E, *W_p, *sources,
+                                            target.is_none() ? -1 : (int)py::cast<py::int_>(target),
                                             sssp);
 
     if (gpu_r != gpu_easygraph::EG_GPU_SUCC) {
@@ -103,7 +103,7 @@ py::object _invoke_gpu_dijkstra_multisource(py::object G,py::object py_sources,
 
     py::array::ShapeContainer ret_shape{(int)sources->size(), (int)V.size() - 1};
     py::array_t<double> ret(ret_shape, sssp.data());
-    
+
     return ret;
 }
 #endif
@@ -137,14 +137,14 @@ py::object _spfa(py::object G, py::object source, py::object weight) {
     while (l != r) {
     	if (r != 0 && dis[Q[l]] >= dis[Q[r - 1]])
     		std::swap(Q[l], Q[r - 1]);
-        int u = Q[l++]; 
-        if (l >= N) l -= N; 
+        int u = Q[l++];
+        if (l >= N) l -= N;
         vis[u] = true;
 
-        for(register int p = head[u]; p != -1; p = E[p].next) {
-            int v=E[p].to; 
+        for(int p = head[u]; p != -1; p = E[p].next) {
+            int v=E[p].to;
             if (dis[v]>dis[u]+E[p].w) {
-                dis[v]=dis[u]+E[p].w; 
+                dis[v]=dis[u]+E[p].w;
                 if (!vis[v]) {
                     vis[v]=true;
                     if (l == 0 || dis[v] >= dis[Q[l]])

{python_easygraph-1.5.1 → python_easygraph-1.5.2}/easygraph/functions/community/__init__.py

@@ -4,3 +4,4 @@ from .LPA import *
 from .modularity import *
 from .modularity_max_detection import *
 from .motif import *
+from .localsearch import *