搜索资源列表
LED
- 在ADT IDE开发环境下实现LED上图形，数字及汉字的显示。-In ADT IDE development environment to achieve the LED graphics, figures and Chinese characters display.
A-symbol-Table-ADT
- This the program which implements symbol table of UNIX.-This is the program which implements symbol table of UNIX.
20111125061851870
- android开发的ADT插件，帮助大家以后学习研究，希望大家学习分享-android ADT
_ADT-GARIS
- ADT Line with a lot of function
hashtable
- hashtable ADT implementation -hashtable ADT implementation . made by java
phonegap-phonegap-1.6.0-0-g66780d6
- PhoneGap 1.6.0:: Prerequisite Software PhoneGap requires you have the following software installed: 1. Eclipse Integrated Design Environment (IDE), a program to write code and manage software development 2. Java Development Kit (JDK)
Johnson
- Johson算法是目前最高效的在无负环可带负权重的网络中求所有点对最短路径的算法. Johson算法是Bellman-Ford算法, Reweighting(重赋权重)和Dijkstra算法的大综合. 对每个顶点运用Dijkstra算法的时间开销决定了Johnson算法的时间开销. 每次Dijkstra算法(d堆PFS实现)的时间开销是O( E * lgd(V) ). 其中E为边数, V为顶点数, d为采用d路堆实现优先队列ADT. 所以, 此种情况下Johnson算法的时间复杂度是O( V *
Floyd-Warshall-c-chengxi
- Johson算法是目前最高效的在无负环可带负权重的网络中求所有点对最短路径的算法. Johson算法是Bellman-Ford算法, Reweighting(重赋权重)和Dijkstra算法的大综合. 对每个顶点运用Dijkstra算法的时间开销决定了Johnson算法的时间开销. 每次Dijkstra算法(d堆PFS实现)的时间开销是O( E * lgd(V) ). 其中E为边数, V为顶点数, d为采用d路堆实现优先队列ADT. 所以, 此种情况下Johnson算法的时间复杂度是O( V *
ADT-0.9.4
- plugin for ANDRIOD DEVELPPER S. this lugin is used for adjusting java language with android package.
c
- 在数据结构中使得复数ADT的实现的一种算法。-In the data structure makes the the plural ADT implementation of an algorithm.
ADT-tree
- 编写二叉树的基本操作函数，用递归方法分别实现先序，中序和后序遍历二叉树。-The preparation of the basic operating functions of the binary tree, recursive preorder, inorder, and postorder traversing a binary tree.
adt-tree
- 二叉排序树：又称二叉查找树。 它或者是一棵空树；或者是具有下列性质的二叉树： （1）若左子树不空，则左子树上所有结点的值均小于它的根结点的值； （2）若右子树不空，则右子树上所有结点的值均大于它的根结点的值； （3）左、右子树也分别为二叉排序树；-Binary sort tree: also known as binary search tree. Or an empty tree or a binary tree with the following properties: (1) If t
KMP-code
- 字符串的KMP匹配算法的ADT形式，只有一次循环优化，含注释，易懂。数据结构与算法的基本代码之一。-KMP matching algorithm of string the ADT form of, only one cycle optimization, including the Notes, and easy to understand. One of the basic code of the data structures and algorithms.
ADT-11.0.0
- java 手机开发，android环境 eclipse插件包-java mobile development
Compressed Suffix Trie
- 构造compressed suffix trie class，并且实现findString()和findLongestCommonSubsequence()功能-implement the compact representation of the compressed suffix trie ADT for DNA analyses.
ADT-20.0.0
- eclipse android开发插件adt20-the eclipse android development plugin adt20
foo
- adt examplein linux using eclipse
AndroidJniNdk
- ADT file for NDK in eclipse
NdkExample.tar
- ADT example with SDk and NDK
Spanning-Tree-Protocol-Configuration-Guide_---ADT
- Spanning Tree Protocol