Apply min_degree filter for full graph query
This commit is contained in:
parent
ca9e958cad
commit
4e2a9b1994
1 changed files with 1 additions and 1 deletions
|
|
@ -312,7 +312,7 @@ class NetworkXStorage(BaseGraphStorage):
|
||||||
nodes_to_keep = [
|
nodes_to_keep = [
|
||||||
node
|
node
|
||||||
for node, degree in subgraph.degree()
|
for node, degree in subgraph.degree()
|
||||||
if (node_label != "*" and (node in start_nodes or node in direct_connected_nodes))
|
if node in start_nodes or node in direct_connected_nodes
|
||||||
or degree >= min_degree
|
or degree >= min_degree
|
||||||
]
|
]
|
||||||
subgraph = subgraph.subgraph(nodes_to_keep)
|
subgraph = subgraph.subgraph(nodes_to_keep)
|
||||||
|
|
|
||||||
Loading…
Add table
Reference in a new issue