链表

  • 网络LIST;Linked list;LinkedList
链表链表
  1. 用C语言链表解决大整数运算的精度问题

    Applying Link List in C Language to Solve Precision of Large Integer Operation

  2. 已有a、b亮光链表,每个链表中的结点包括学好、成绩。

    Have a , b light list , each node in the list , including learn , results .

  3. 他将链表绕挂在脖子上,就像戴了一枚大奖章。

    He wore the watch and chain looped round his neck like a medallion .

  4. 经典桶排序算法以链表形式实现桶,处理均匀数据效率很高,是O(N)算法。

    Classical bucket sort algorithm implements buckets as dynamic lists .

  5. 基于GIS和链表结构的配网故障后恢复重构

    The restoration reconfiguration after distribution system fault based on GIS structure

  6. JAVA实现数据结构链表相关程序

    Related Program of JAVA Data Structure Static Void

  7. 现在,假设一个线程试图通过调用pushback把n个整数连续地添加到这个链表中。

    Now , consider a thread trying to push n integers into this list in quick succession by calling push_back .

  8. 每一节点处的代价采用链表open或closed进行存储,A算法中最后的closed链表存储的就是最优节点序列。

    Cost of each node is stored in linked chart . The eventually closed chart is sequence of optimal nodes .

  9. array是一种类型,所以array应用在链表上,就相当于把浮点型应用在整形上。

    Array is a type , so array applied to the list is just like applying float to an int.

  10. 指向兄弟进程链表中下一个和前一个元素的指针,兄弟进程指的是与P有相同父进程的进程。

    The pointers to the next and previous elements in the list of the sibling processes , those that have the same parent as P.

  11. 当我试图创建一个描述链表结构的XMLSchema,问题产生了。

    The problem arises when I try to create an XML Schema that describes the linked list structure .

  12. 基于链表结构的IPv6网络数据采集方法

    Methods of Collecting IPv6 Network Data Based on Link Table Structure

  13. 我们需要根据日志标记名使用的散列值对具有链表(linkedlist)的散列表进行查询。

    We look up a hash table with linked list based upon the hash key for the logging token name .

  14. 基于哈希链表和时间链表的HTTP代理缓存机制的实现

    Implement of Http Proxy ′ s Cache Mechanism Based on Hash Link-Table and Time Link-Table

  15. 在主控服务器的程序中建立socket的链表完成任务调度。

    Establish socket linked list to complete the task scheduling program of the master server .

  16. 词条数组中的每个词条(ti)有一个指针,指向含有ti的所有文本组成的链表。

    Each entry in the Term array has a pointer to contain all the linked list consisted by text .

  17. 通过Bloomfilter这种简洁的结构表示地址链表,可以减少添加到报文中的轨迹长度,利用Bloomfilter的或运算可以简化传输节点的冗余判断。

    The Bloom Filter can succinctly present the address list and simplify the query actions in the list by OR operations .

  18. 如果只有一个到这个页的映射,那么可以用一个叫做“direct”的指针来代替链表。

    If there is only a single mapping to the page , then a single pointer called " direct " can be used instead of a linked list .

  19. DDR地址链表管理的FPGA实现

    FPGA Realization in the Management of DDR Address Chain-list

  20. 用JAVA程序把数据结构链表的删除结点(头结点,尾结点),以及链表的遍历、倒链程序结合到一起作介绍。

    The paper introduces how to combine data structure static void deletion , static void travel throughout and static void reverse with JAVA program .

  21. 由于使用了Visualc++语言MFC类库进行网格剖分数据链表的管理,使得编程容易,整个程序简单实用。

    The programming with Visual C + + is relatively simple by using MFC Library function to manage the list .

  22. 基于哈希链表的HAWAII微移动协议认证方案

    Hash-Chain Trees Based Security Scheme in HAWAII Micro-Mobility Protocol

  23. 根据电路CAD软件设计结构的要求,对自动布线的输入数据采用文本文件的输入方式和链表的存储格式。

    According to the design structure of circuit CAD software , data are putted into the routing program by text file and are stored in data chain .

  24. 提出了冲突链表节点内存合并的方法加速链表查找速度,有效减少了查找操作对SRAM的访问次数。

    Hash collision chain node consolidation is proposed to quicken up chain search .

  25. 这意味着模式必须不仅仅代表XML看上去的样子,它必须代表根本的数据结构:链表。

    This means the schema must represent more than simply what the XML looks like , it must represent the essence of the data structure : a linked list .

  26. 本文将只讨论单链表;术语“链表(linkedlist)”和“列表(list)”都被用来表示单链表。

    This article will discuss only singly linked lists ; the terms " linked lists " and " lists " will both be used to mean singly linked lists .

  27. 基于十字链表的Apriori改进算法

    Improved Apriori Algorithm Based on Across Linker

  28. 该算法基本思想是采用计数型Bloomfilter与动态链表相结合的方式,实现报文分类的功能。

    The core idea of this algorithm is to make the function of packet classification by combining the counting Bloom filter with the dynamic chain lists .

  29. 并根据C语言结构功能强的特点,采用结构指针及链表、队列等动态数据结构,使整个算法具有节省内存、快速省时的特点。

    Applying structure pointer and dynamic data structure , such as the linked list and queue in C , we have made the working software executed with less memory requirement and time overhead .

  30. 双向Dijkstra算法及中间链表加速方法

    Bi-directional Dijkstra Algorithm and the Acceleration of Intermediate List