-
本程序用另外一种算法即近邻算法解决TSP,即旅行商问题,请高手指教....
本程序用另外一种算法即近邻算法解决TSP,即旅行商问题,请高手指教.-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.
- 2022-05-11 02:39:42下载
- 积分:1
-
用VB6创建的家庭地址簿程序。制作该程序的主要目的是用来为家庭中的每个成员存储个人地址信息。而且该程序的用户设定为两个类型级别:即1管理型、2用户型...
用VB6创建的家庭地址簿程序。制作该程序的主要目的是用来为家庭中的每个成员存储个人地址信息。而且该程序的用户设定为两个类型级别:即1管理型、2用户型-built with VB6 family address book procedures. The production process is the main purpose for the family members of each of the addresses stored personal information. And the procedures set of users for the two types of levels : that is a management-type, two-users
- 2022-03-15 13:23:06下载
- 积分:1
-
从ACCESS文件中提取DBF文件,可以将ACCESS文件中提取DBF文件,并建立一个数据库文件,包括ACCESS文件中的所有表....
从ACCESS文件中提取DBF文件,可以将ACCESS文件中提取DBF文件,并建立一个数据库文件,包括ACCESS文件中的所有表.-ACCESS documents from the DBF file extraction can be extracted ACCESS DBF file documents, and the establishment of a database file, including documents, the ACCESS all the tables.
- 2022-02-22 12:36:12下载
- 积分:1
-
basic data structure class definition and realization : MyStack, MyPoint, MyArc,...
基本数据结构类的定义和实现: MyStack ,MyPoint,MyArc,Graph,MyQueuesMyStack为构造的一个通用的C++模版堆栈类 MyPoint为一个坐标结构MyArc为带权的边类Graph为临街矩阵表示的图MyQueues为按权值顺序存储的边的队列-basic data structure class definition and realization : MyStack, MyPoint, MyArc, Graph, MyQueuesMyStack for a generic structure of the C category MyPoint stack template for a structure MyArc to coordinate with the right side of the street like Graph Matrix plans MyQueues value of the order by the right side of the storage Queue
- 2023-08-10 15:55:02下载
- 积分:1
-
北大ACM1003(Hangover)
北大ACM1003(Hangover)-North ACM1003 (Hangover)
- 2022-02-03 12:26:03下载
- 积分:1
-
pb 源码 进度条程序
pb 源码 进度条程序-progress of the process
- 2023-05-04 19:50:03下载
- 积分:1
-
link list code
在计算机科学中,链表是;
- 2023-04-30 06:10:02下载
- 积分:1
-
有需要的同仁载回去慢慢研究
有需要的同仁载回去慢慢研究-need colleagues set back slowly study
- 2022-08-03 12:27:33下载
- 积分:1
-
求解网络中的最短路径。假设某个计算机网络有n个站点,依次编号为1,2,…,n;有的站点之间有直接的线路连接(即这两个站点之间没有其它站点),有的站点之间没有直接...
求解网络中的最短路径。假设某个计算机网络有n个站点,依次编号为1,2,…,n;有的站点之间有直接的线路连接(即这两个站点之间没有其它站点),有的站点之间没有直接的线路连接。如果用三元组(i,j,f)来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组(i1,j1,f1),(i2,j2,f2),…,(im,jm,fm)确定时,要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.
- 2023-05-31 21:45:02下载
- 积分:1
-
严蔚敏编写的《数据结构》第7章的答案,全部为源码
严蔚敏编写的《数据结构》第7章的答案,全部为源码-the answers of chapter 7 of a book called ‘Data Structures’ writen by Yan Wei Min
- 2022-03-13 00:24:29下载
- 积分:1