Combinatorica`
Combinatorica`

CompleteQ

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

CompleteQ[g]

yields True if graph g is complete. This means that between any pair of vertices there is an undirected edge or two directed edges going in opposite directions.

更多信息和选项

范例

基本范例  (2)

CompleteQ has been superseded by CompleteGraphQ:

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

文本

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

CMS

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

APA

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

BibTeX

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

BibLaTeX

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