NeighborhoodVertices

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


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


gives vertices that can be reached from vertex i.

更多信息更多信息

范例范例打开所有单元关闭所有单元

基本范例  (2)基本范例  (2)

In[1]:=
Click for copyable input

This defines a simple directed graph:

In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=

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

In[4]:=
Click for copyable input
Out[4]=

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

In[5]:=
Click for copyable input
Out[5]=

has been superseded by NeighborhoodGraph:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
In[3]:=
Click for copyable input
Out[3]=