-
数据结构的课后练习，全会做就能过这门课了
数据结构的课后练习，全会做就能过这门课了-Data structure after-school practice
- 2022-08-22 08:03:46下载
- 积分：1
-
用C语言编写的贪吃蛇游戏，运行是按任意键开始，不过呢，反向也算输哟！...
用C语言编写的贪吃蛇游戏，运行是按任意键开始，不过呢，反向也算输哟！-Using C language game of Snake, run is started by pressing any key, however, the reverse also count yo loser!
- 2022-02-13 15:11:40下载
- 积分：1
-
神经网络中的K均值聚类算法II：
1.KMIn为输入数据文本，其中，第一个参数为所要聚类点个数，第二个参数为聚类点的维数,第三个参数为所要求聚类的个数...
神经网络中的K均值聚类算法II：
1.KMIn为输入数据文本，其中，第一个参数为所要聚类点个数，第二个参数为聚类点的维数,第三个参数为所要求聚类的个数
2.KM2OUT为经过K均值聚类算法II计算后得到的结果-Neural network in K-means clustering algorithm II: 1.KMIn input data for the text, of which the first parameter to be the number of clustering points, the second parameter is the dimension of clustering points, the third parameter for the clustering the number of requests for 2.KM2OUT after K-means clustering algorithm II calculation results
- 2022-08-10 11:09:03下载
- 积分：1
-
Semantic Ontology word Inquiry System
基于语义本体的单词查询系统-Semantic Ontology word Inquiry System
- 2022-03-24 21:50:31下载
- 积分：1
-
wce4.0,database,
wce4.0,database,- wce4.0,database
- 2023-04-05 13:20:04下载
- 积分：1
-
to document the data Huffman coding and decoding, data presents given weight, sh...
对文件中的数据进行哈夫曼编码和解码,列出给定数据的权重,列出左右孩子和父亲节点的列表,对任意数据进行进行哈夫曼编码和解码-to document the data Huffman coding and decoding, data presents given weight, shown around children and the father node list of arbitrary data for Huffman coding and decoding
- 2022-03-16 02:51: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
-
Environment: visual studio 2005
以visual studio 2005为开发环境的约瑟夫环设计。-Environment: visual studio 2005
- 2023-05-01 17:20:03下载
- 积分：1
-
This procedure using ACC core data elements! !
Features:
Program code to re
- 2023-03-21 23:05:04下载
- 积分：1
-
栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进...
栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进者先出，即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器，每次只可以从顶端压入一个硬币，而取出也只可以从顶端进行，即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如，编译系统中(这是一类比较复杂的程序)，对于函数调用的处理、对于表达式计算的处理，都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently
meets the vitality one kind of construction of data form under, it has
such characteristic regarding data depositing and the operation: 1) it
only has a logarithm according to the port which carries on stores and
takes out; 2) less advanced first leaves, namely finally the data
which will store first is taken out. Its form looks like one kind of
memory coin very much the small container, each time only may press in
a coin from the peak, but takes out also only may carry on from the
peak, namely less advanced first leaves. Such data storage and the
management form are very useful in some programmings. For example, in
the compiling system (this is a kind of quite complex procedure),
transfe
- 2023-08-22 21:50:04下载
- 积分：1
