delphi写的读股票K线源代码

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,

卡耐基 梅隆大学软件工程 第七门课程数据库管理系统ssd7 练习3-Carnegie Mellon University Software Engineering VII Database Management System course ssd7 practice 3

用VFP编写的报亭管理系统-VFP prepared by the newsstand Management System

是一种数据结构的编程代码，程序实现一种算法，在铁路系统上在两点间得到最短路径-is a data structure of the programming code, procedures to achieve an algorithm, the railway system in the period between 2:00 Shortest Path

计算10000以内的阶乘,计算阶乘的程序-calculation 10,000 within the factorial calculated factorial procedure

数据库课程设计,设计一个订户订阅报刊的应用系统-Database of curriculum design, the design of a subscriber subscriptions to newspapers and magazines of the application system

经典最短路径算法C C++ 邻接矩阵实现-Classic shortest path algorithm C C++ Realize adjacency matrix

最短路径的具体实现，使用了dikstra算法-Concrete realization of the shortest path, using the algorithm dikstra

环形链表结点出排-circular linked list node wait-

程序分析，主要功能有，但界面还没加上，基本实现了功能要求。-program analysis, the main function, but with no interface and the basic realization of the functional requirements.