Combinatorica`
Combinatorica`

SimpleQ

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

SimpleQ[g]

yields True if g is a simple graph, meaning it has no multiple edges and contains no self-loops.

更多信息和选项

范例

基本范例  (2)

SimpleQ has been superseded by SimpleGraphQ:

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

文本

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

CMS

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

APA

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

BibTeX

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

BibLaTeX

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