NeighborhoodSubgraph
NeighborhoodSubgraph[g,i,r]
gives a subgraph consisting of vertices that can be reached from vertex i within r hops.
NeighborhoodSubgraph[g,i]
gives a subgraph consisting of vertices that can be reached from vertex i.
更多信息和选项
- NeighborhoodSubgraph functionality is now available in the built-in Wolfram Language function NeighborhoodGraph.
- To use NeighborhoodSubgraph, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- NeighborhoodSubgraph returns a subgraph consisting of vertices that can be reached from a given vertex within certain hops.
范例
基本范例 (2)
This defines a simple directed graph:
This finds a subgraph from vertices that can be reached from vertex 2 within 1 hop:
NeighborhoodSubgraph has been superseded by NeighborhoodGraph:
文本
Wolfram Research (2007)，NeighborhoodSubgraph，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/NeighborhoodSubgraph.html.
CMS
Wolfram 语言. 2007. "NeighborhoodSubgraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/NeighborhoodSubgraph.html.
APA
Wolfram 语言. (2007). NeighborhoodSubgraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/NeighborhoodSubgraph.html 年