Combinatorica`
Combinatorica`

InDegree

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

InDegree[g,n]

returns the in-degree of vertex n in directed graph g.

InDegree[g]

returns the sequence of in-degrees of the vertices in directed graph g.

更多信息和选项

范例

基本范例  (2)

InDegree has been superseded by VertexInDegree:

Wolfram Research (2012),InDegree,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html.

文本

Wolfram Research (2012),InDegree,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html.

CMS

Wolfram 语言. 2012. "InDegree." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html.

APA

Wolfram 语言. (2012). InDegree. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html 年

BibTeX

@misc{reference.wolfram_2024_indegree, author="Wolfram Research", title="{InDegree}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html}", note=[Accessed: 18-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_indegree, organization={Wolfram Research}, title={InDegree}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/InDegree.html}, note=[Accessed: 18-November-2024 ]}