登录
首页 » Visual C++ » Data-structure-diagram

Data-structure-diagram

于 2011-06-27 发布 文件大小:153KB
0 205
下载积分: 1 下载次数: 1

代码说明:

  数据结构中图的存储结构的建立与搜索 建立图的二种存储结构 在不同的结构上实现遍历 (Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Z
    说明:  在给定的字母中,用c++来实现字母的排序(In a given letter, the use of c++ to implement the letter of the sort)
    2010-06-29 21:59:50下载
    积分:1
  • bracketmatching
    这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)
    2013-01-21 21:48:17下载
    积分:1
  • POJ2371
    PKU ONLINEJUDGE 2371
    2011-10-21 15:03:03下载
    积分:1
  • xuanzexingjiegou
    选择型结构c语言编程 (Choose the type of structure of C language programming)
    2013-09-24 22:11:37下载
    积分:1
  • kaikuohaohebikuohaodepipei
    开括号和比括号的匹配,数据结构内容,很不错(More than brackets and brackets to open the match, the contents of data structure)
    2009-04-13 14:35:56下载
    积分:1
  • main5
    编写一个将二叉树的所有叶子结点从左向右链接成单链表的算法(Write a binary tree leaf nodes from left to right links into a single linked list algorithm)
    2012-10-07 23:52:44下载
    积分:1
  • BigNumeberOperator
    这是高精度大数运算的源码,对于大于64位的整形数字的四则运算,是万能的啊……(This is the code of big number s operator.)
    2011-08-09 15:25:09下载
    积分:1
  • HuffanCoding
    读取数据,统计所得到的文件中每个字母的权值,创建哈夫曼树,哈夫曼编码。哈夫曼解码,解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组,最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计,统计每个字母出现的次数,次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据,哈夫曼树根据每个字母权值的大小来创建,每个节点,包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码,将此编码返回。 根据哈夫曼树得到的数组即为解码数组,解码数组作为解码的结果返回。 写入输出文件,将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入,将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
    2020-07-02 15:40:01下载
    积分:1
  • Test6
    最短路径算法。 用无向带全图的邻接矩阵存储图,确定从源点出发到其它各点的最短路径。 输入:图中包含的顶点数n 边数m, 各边权值,用邻接矩阵或者邻接表存储。 输出:源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
    2014-05-11 17:05:37下载
    积分:1
  • mapsearch
    数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
    2016-01-09 17:34:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载