Reachable and induced subgraphs

[monarchi]

Hello -

Apologies in advance if this is documented somewhere. A search of the forums and the Internet did not provide me with any answers.

Given a initial set of nodes, I'm trying to create both the reachable and induced subgraphs of that set based on my original directed graph. I can write the code to do this, but hoped that the mechanism already existed in Gephi.

Any suggestions or references would be greatly appreciated.

Thank you.

David

[monarchi]

Just a clarification of my original question. I am trying to find the reachable subgraph given a set of 27 nodes using only the outlinks from the nodes. For this reason, the neighbors network doesn't work for me unless there is a way to specify link direction that I'm not seeing.

More broadly, I can't find a filter that allows me to get edges based on direction given a set of starting nodes. The source and target nodes (i.e., attribute values) of an edge do not seem to be accessible within the filters.

Any advice/suggestions would be appreciated.

Thank you,
David