在图的一种双链式存储结构的基础上提出了一种扩展的双链式存储结构。
This paper presents an extended double list storage structure based on a double list storage structure and then applies it to the minimum spanning tree algorithm.
在索引更新部分本文提出了三种顺序存储方式下准动态的索引更新策略，一种链式存储格式下索引动态更新的算法。
In the part of index renewal, this paper proposed three dynamic index updating strategies based on order memory, and a kind of index dynamic updating algorithm based on chain memory.
利用DNA分子和连接酶的生物特性，提出DNA计算机中二叉树的链式存储结构的设计方法，并给出二叉树链式存储结构的形式描述。
This paper proposed the method of designing linked storage structure of the binary tree in DNA computer, which utilized the biological characteristics of DNA molecules and ligases.
本文提出了图的一种双链式存储结构，比以往的图的链式存储结构有更好的灵活性，并在图的各种算法的实现上显示了较好的时空复杂性，具有其它存储结构所不具备的各种优点。
In this paper, a new data structure of graph, double list, is presented. It is more flexible than other data structures of graph and shows better time and space complexity in graph algorithms.
对象变量引用本质上就是一种动态存储方法，在此基础上便能实现链式动态存储。
In substance, citing of object variable is a method of dynamic storage, which dynamic storage based on link can be implemented.
层状链式图是根据模式的L长度分层存储命中模式，它不需要按照直接可达祖先思想创建路径的节点，因此减少了非命中模式节点的存储。
Chained data structure keep hit-set by its L-length. it does not need to create ancestor nodes, so it can reduce the saving of none hit-set and the room of matching the patterns.
层状链式图是根据模式的L长度分层存储命中模式，它不需要按照直接可达祖先思想创建路径的节点，因此减少了非命中模式节点的存储。
Chained data structure keep hit-set by its L-length. it does not need to create ancestor nodes, so it can reduce the saving of none hit-set and the room of matching the patterns.
应用推荐