-
用matlab实现最小生成树,GA算法,克鲁斯卡尔算法和prim算法三种方法
用matlab实现最小生成树,GA算法,克鲁斯卡尔算法和prim算法三种方法,自行输入图信息,实现最小生成树,处理如旅行商问题,推销员问题等。熟悉matlab的操作和函数的使用。
- 2023-01-11 04:05:03下载
- 积分:1
-
windows系统编程源代码
windows系统编程源代码-windows system program source codes.
- 2022-03-03 11:03:10下载
- 积分:1
-
图书管理系统
我所上传的是图书管理系统,代码简单易懂,很适合初学者,中间用到了struts,hibernate,spring数据库用的是mysql。
- 2023-05-04 22:55:02下载
- 积分:1
-
explains the technique of finding permutations and provides source code for the...
explains the technique of finding permutations and provides source code for the recursive implementation
- 2022-01-25 23:12:27下载
- 积分:1
-
TTS(Text To Speak),文本转语音程序,需要安装捷通华声引擎
TTS(Text To Speak),文本转语音程序,需要安装捷通华声引擎-TTS (Text To Speak), text-to-speech procedures need to install the Czech News The content engine
- 2023-05-03 09:35:03下载
- 积分:1
-
piano learning process is a compilation of language was often asked to do a simp...
钢琴程序是一个学习汇编语言时常被要求去做的一个简单程序,也是我自己弄了一天才弄出来的,望君一看-piano learning process is a compilation of language was often asked to do a simple procedure, I get one day get out of a hope to see you
- 2022-02-10 02:10:03下载
- 积分:1
-
曾经牛HOOKAPI开发工具包,使钩的制备成为…
有史以来最牛的hookapi开发包,让编写钩子变得很简单,你只需要编写自己的处理函数即可,其他的都是通用的。赶紧分享-Ever cattle hookapi development kit to enable the preparation of the hook becomes very simple, you just need to write your own handler you do, other are common. Hurry Share
- 2022-02-14 12:02:08下载
- 积分:1
-
a multi
a multi-threaded web crawler in java.
- 2022-02-21 19:56:38下载
- 积分:1
-
the implementation of the code read from the Outlook address book's contents...
本代码实现了从outlook读取通讯簿里的内容。-the implementation of the code read from the Outlook address book"s contents.
- 2022-03-16 13:32:50下载
- 积分:1
-
用回溯法求解KnightTour问题
【KnightTour问题】在一个8×8的棋盘上,检验以某一位置作为出发点的棋子能否遍历一次棋盘上的所有棋格,且最后回...
用回溯法求解KnightTour问题
【KnightTour问题】在一个8×8的棋盘上,检验以某一位置作为出发点的棋子能否遍历一次棋盘上的所有棋格,且最后回到出发点。(备注:棋子每次只能沿东、南、西、北、东南、西南、东北、西北方向走一步!!)-Method with back issues KnightTour】 【KnightTour issues in a 8 × 8 chessboard, the examination for the position as the starting point of a piece of a chessboard can traverse all the chess grid, and the final return to the starting point. (Note: each piece can only be along the east, south, west, north, southeast, southwest, northeast, northwest direction step!!)
- 2022-03-12 08:40:20下载
- 积分:1