I would like to run some graph data science algorithms on a sub spanning tree of nodes and relations of a larger graph. To get the spanning tree, I use the APOC library.
WHERE e.property in ["foo", "bar"] # some property condition
I hadn't thought of adding labels. That might be a good option. Thanks for the help though!
I'll also try asking in the GDS github repo to see if the devs have any other ideas. If anything comes up I'll post it here as well.