NeighborhoodVertices

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »

NeighborhoodVertices[g,i,r]

gives vertices that can be reached from vertex i within r hops.

NeighborhoodVertices[g,i]

gives vertices that can be reached from vertex i.

Details and Options

NeighborhoodVertices functionality is now available in the built-in Wolfram Language function NeighborhoodGraph.
To use NeighborhoodVertices, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
NeighborhoodVertices returns the vertices that can be reached from a given vertex within certain hops.

This defines a simple directed graph:

This finds all vertices that can be reached from vertex 2 within 1 hop:

This finds all vertices that can be reached from vertex 2:

NeighborhoodVertices has been superseded by NeighborhoodGraph:

Top