We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 3f8507c commit a8043a6Copy full SHA for a8043a6
nano_graphrag/_op.py
@@ -786,10 +786,17 @@ async def _find_most_related_edges_from_entities(
786
all_related_edges = await asyncio.gather(
787
*[knowledge_graph_inst.get_node_edges(dp["entity_name"]) for dp in node_datas]
788
)
789
- all_edges = set()
+
790
+ all_edges = []
791
+ seen = set()
792
793
for this_edges in all_related_edges:
- all_edges.update([tuple(sorted(e)) for e in this_edges])
- all_edges = list(all_edges)
794
+ for e in this_edges:
795
+ sorted_edge = tuple(sorted(e))
796
+ if sorted_edge not in seen:
797
+ seen.add(sorted_edge)
798
+ all_edges.append(sorted_edge)
799
800
all_edges_pack = await asyncio.gather(
801
*[knowledge_graph_inst.get_edge(e[0], e[1]) for e in all_edges]
802
0 commit comments