ToUnorderedPairs[g]
constructs a list of unordered pairs representing the edges of graph 
. Each edge, directed or undirected, results in a pair in which the smaller vertex appears first.
ToUnorderedPairs
ToUnorderedPairs[g]
constructs a list of unordered pairs representing the edges of graph 
. Each edge, directed or undirected, results in a pair in which the smaller vertex appears first.
更多信息和选项
- ToUnorderedPairs functionality is now available in the built-in Wolfram Language function EdgeList.
- To use ToUnorderedPairs, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- An option called Type that takes on values All or Simple can be used, with All being the default value. Type->Simple ignores multiple edges and self-loops in
.
文本
Wolfram Research (2012)，ToUnorderedPairs，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/ToUnorderedPairs.html.
CMS
Wolfram 语言. 2012. "ToUnorderedPairs." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/ToUnorderedPairs.html.
APA
Wolfram 语言. (2012). ToUnorderedPairs. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/ToUnorderedPairs.html 年