Combinatorica`
Combinatorica`
KnightsTourGraph
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
KnightsTourGraph[m,n]
returns a graph with m n vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight from one square to another.
更多信息和选项
- KnightsTourGraph functionality is now available in the built-in Wolfram Language function KnightTourGraph.
- To use KnightsTourGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012)，KnightsTourGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/KnightsTourGraph.html.
文本
Wolfram Research (2012)，KnightsTourGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/KnightsTourGraph.html.
CMS
Wolfram 语言. 2012. "KnightsTourGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/KnightsTourGraph.html.
APA
Wolfram 语言. (2012). KnightsTourGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/KnightsTourGraph.html 年