How to filter graph for n-th degree neighbor vertices from given vertex?

Mar 21, 2015 at 11:38 AM

Please advise, how filter graph for n-th degree neighbor vertices from given vertex?

I can't understand if this possible using "dynamic" filters or "visibility" column in vertices worksheet.

There is an easy algorithm to show all neighbor vertices for 1st degree...
I create the column with "or" function - if vertex "n" is in first or second row of vertices - list is filtered to 1st degree nodes, connected to given vertex "n". But how to do this for 2nd or 3rd degree neighbors.

In Neo4J (graph database) it would be following Cypher query (SQL like language used by neo4j)
MATCH (vertex {name: "vertex_name_here"})-[:*0..1]->(x) RETURN x

If I want to query 2nd degree, it will be changed to 2 and so forth...
MATCH (vertex {name: "vertex_name_here"})-[:*0..2]->(x) RETURN x

How to do this in nodexl?
Maybe there is some VBA code or additional plugin for this?

Mar 21, 2015 at 5:50 PM

Thank you for the interest in NodeXL.

You can select a single node by clicking it.

To select its nearest neighbors, double click the node.

Clicking again will select neighbor's neighbors.

Alternatively, right-click a node and select the "Select subgraphs..." option which will display this dialog box:


You may select the number of degrees from the selected vertex to add to the active selection.


Mar 21, 2015 at 6:54 PM
Marc, thanks.
That is exactly what I was talking about.
Also I found that "subgraph images" function does some very nice automation for this task.
Now in need to do this automagically - need to learn NodeXL API. I will raise the separate discussion on that.