拓扑排序c版(数据结构)1.邻接表的实现 2.无环情况

64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解算法的实现-64 within Rabin-Miller-puppet prime testing and Pollard rho factorization algorithm implementation

2005软件工程师考试下午编程题源代码-2,005 software engineers at the examination program that the source code!

C++方面有深度的算法例子，提供完整源代码-C++ Aspects algorithm-depth examples, provide a complete source code

实时曲线类的改进增加功能: 1)采样数据存盘和加载 2)演示程序中可以实现图形的打印预览和打印功能,曲线从原点开始-Improvement of real-time curve of increasing the number of functional categories: 1) sampling data to disk and load 2) presentation graphics program can print and print preview function, curve from the origin to start

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.

数据结构用C语言实现，算法较巧妙-data structure using C language, the algorithm more cleverly

如果要连接的数据库文件和当前文件在同一个目录下-If you want to connect to the database file and the current document in the same directory

软件工程 卡耐基 数据库 ssd7 ex1-ssd ex1

分别用C语言和C++语言写的用于三角网格划分的算法。划分效果和速度都不错-Were used C language and C++ language written for the triangular meshing algorithms. Into the effectiveness and speed are good

此为初步实现，简单直观，可在此基础上增强功能。-preliminary achieve this, simple, and the basis of this enhanced functionality.