跳转到内容
Main menu
Main menu
move to sidebar
hide
Navigation
Main Page
Help
Browse
Cookbook
Wikijunior
Featured books
Recent changes
Random book
Using Wikibooks
Community
Reading room forum
Community portal
Bulletin Board
Help out!
Policies and guidelines
Contact us
Search
Search
Donations
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Discussion for this IP address
A 级数学/OCR/D1/节点图/旅行商问题
Add languages
Add links
Book
Discussion
English
Read
Edit
Edit source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
Edit source
View history
General
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Sister projects
Wikipedia
Wikiversity
Wiktionary
Wikiquote
Wikisource
Wikinews
Wikivoyage
Commons
Wikidata
MediaWiki
Meta-Wiki
Print/export
Create a collection
Download as PDF
Printable version
In other projects
Wikidata item
外观
移动到侧栏
隐藏
来自维基百科，开放的书籍，面向开放的世界
<
A 级数学
|
OCR
|
D1
|
节点图
旅行商（分为上下界算法）要求一个节点至少访问一次，并回到哈密顿回路中的起始节点
此页或章节为未开发草稿或提纲。
您可以帮助
开发此工作
，也可以在
项目室
中寻求帮助。
分类
:
Book: A 级数学/OCR/D1
隐藏分类
存根
华夏公益教科书
