Haffman

数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)

单链表的增删查改功能,可以实现单链表的创建、传入数据；并能实现对已有单链表的插入数据、删除数据等功能。(Single linked list of additions and deletions check change function, you can achieve the creation of a single list, incoming data insert data of existing single linked list, delete data and functions.)

道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)

图中计算最短路径，必须覆盖所有的节点，效率很高(to compute the shortest path in the graph)

数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)

计算边介数,复杂网络，中心性计算，介数也可以计算，运用了数据结构，计算大量数据(edge betweenness，complex network， centrality)

效验算法单循环链表，这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)

吴伟民版数据结构每个算法的c实现方法，并模块化处理，将各个功能分开编程，有助于移植使用(failed to translate)

数据结构中图的存储结构的建立与搜索 建立图的二种存储结构 在不同的结构上实现遍历 (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)