Extract from a graph the neighbourhood of all or of a set of seed nodes.
The accepted input formats are GML, tab-delimited and adjacency matrix.
For more explanations about these, refer to the manual of convert-graph.
Two types of output formats are available.
Without any specification, the program will return a four column
file "neighbour", "seed", "number of steps" and "direction". This output can then be compared to other file using graph-get-clusters or compare-classes
The program can return one line for each seed node and display some information about the seed nodes neighbours. This option only works with weighted graphs.
Column specifications (only for tab-delimited format)
Source and target column. Columns containing the source and target nodes.
Weight or label column Column containing the weight or the label on the edge.
The seed nodes for which the degree is seeked
Seed nodes inclusion
Include each node in its neighborhood, with a distance of 0,
even if there is no self-loop at this node. This allows to
extract the node together with its neighborhood, rather than the
neighborhood only (default). This option cannot be used with the
one line per seed node format.
This option allow to return only in or out neighbours. This option can only be used with a number of step equal to 1 and without including the self nodes in the neighbourhood.