求单源点最短路径算法，对一个途中各个节点和权值的设置，找出从起始点倒终结点的一条最短路径，不能够输出路径...

Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).

本桌面软件应用窗体，自定义菜单常用工具，数据表加密，树形控件等技术。新学者可以从中学习。人性化和个性化的界面设计，笑料十足，着实让人眼前一亮

显示当前系统时间，日期，，并用几中不同的格式输出-shows the current system, date, time, and used several different output formats

6个经典数据结构JAVA解法，供学习。-six classic data structures Java Solution for learning.

货郎担问题的分支限界算法，速度很快，并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35

对文件中的数据进行哈夫曼编码和解码,列出给定数据的权重,列出左右孩子和父亲节点的列表,对任意数据进行进行哈夫曼编码和解码-to document the data Huffman coding and decoding, data presents given weight, shown around children and the father node list of arbitrary data for Huffman coding and decoding

这时关于树的一些操作的程序，包括建立，遍历....对学习数据结构的朋友一定有用-This programe implements some operation of tree,for example,construction,traversal and so on.It is very useful for people who study data structure.

快速排序 不是稳定的快速排序 优化了的原位快速排序

城市之间的最短路径，用于求任意两个城市之间的最短路径-cities in the shortest path for the two cities arbitrary seeking the shortest path between

实现了插入排序，希尔排序， 冒泡排序，快速排序，选择排序，堆排序和归并排序，以及可以对排序的性能进行分析，较适合用作排序算法的学习-achieved insertion sort, Hill, in order Bubble Sort, quick sort, select, in order of ranking and sculpture merge sorting, and sequencing can analyze the performance and more appropriate for the learning algorithm