Merge branch 'pybind11' of https://github.com/easy-graph/Easy-Graph i…

…nto pybind11

README.rst

@@ -27,6 +27,7 @@ Introduction
 
 News
 ----
+- [02-05-2024] We release EasyGraph 1.1! This version features hypergraph analysis and learning for higher-order network modeling and representation.
 - [08-17-2023] We release EasyGraph 1.0!
 - [08-08-2023] Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" has been accepted by Patterns!
 

easygraph/functions/community/ego_graph.py

@@ -53,10 +53,11 @@ def ego_graph(G, n, radius=1, center=True, undirected=False, distance=None):
         """
     else:
         if distance is not None:
-            sp = eg.single_source_dijkstra(G, n, cutoff=radius, weight=distance)
+            sp = eg.single_source_dijkstra(G, n, weight=distance)
         else:
-            sp = eg.single_source_dijkstra(G, n, cutoff=radius, weight=distance)
-    nodes = list(sp.keys())
+            sp = eg.single_source_dijkstra(G, n)
+    nodes = [key for key, value in sp.items() if value <= radius]
+    nodes = list(nodes)
     # for i,wd in sp.items():
     #    print(i,wd)
     H = G.nodes_subgraph(nodes)