ToOrderedPairs[g]
constructs a list of ordered pairs representing the edges of the graph
.
ToOrderedPairs
ToOrderedPairs[g]
constructs a list of ordered pairs representing the edges of the graph
.
更多信息和选项
- ToOrderedPairs functionality is now available in the built-in Wolfram Language function EdgeList.
- To use ToOrderedPairs, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- If
is undirected each edge is interpreted as two ordered pairs. - An option called Type that takes on values Simple or All can be used to affect the constructed representation.
- Type->Simple forces the removal of multiple edges and self-loops. Type->All keeps all information and is the default option.
相关指南
-
▪
- Graph Construction and Representations ▪
- Graphs & Networks ▪
- Graph Visualization ▪
- Computation on Graphs ▪
- Graph Construction & Representation ▪
- Graphs and Matrices ▪
- Graph Properties & Measurements ▪
- Graph Operations and Modifications ▪
- Statistical Analysis ▪
- Social Network Analysis ▪
- Graph Properties ▪
- Mathematical Data Formats ▪
- Discrete Mathematics
文本
Wolfram Research (2012),ToOrderedPairs,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/ToOrderedPairs.html.
CMS
Wolfram 语言. 2012. "ToOrderedPairs." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/ToOrderedPairs.html.
APA
Wolfram 语言. (2012). ToOrderedPairs. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/ToOrderedPairs.html 年
BibTeX
@misc{reference.wolfram_2025_toorderedpairs, author="Wolfram Research", title="{ToOrderedPairs}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/ToOrderedPairs.html}", note=[Accessed: 20-April-2026]}
BibLaTeX
@online{reference.wolfram_2025_toorderedpairs, organization={Wolfram Research}, title={ToOrderedPairs}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/ToOrderedPairs.html}, note=[Accessed: 20-April-2026]}