migong

堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)

校园导航系统 1） 校园景点介：绍介相关景点的有关详细信息。 2） 最佳路线查询：查询校园中任意两点之间所有路线，并提供两点间最短的简单路径。 3） 关节点查询：提供校园图的关节点查询。 4） 多景点最佳路线查询：提供多个景点的最佳线路查询，即求途径这个景点的最佳路径。 (Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)

输入俩条线段的首尾坐标，用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)

数据结构，关键路径问题，设计并实现关键路径的一种应用，采用图的算法(Data structure, critical path problem, using graph algorithm)

大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)

单链表逆置的源码~提供了源码和源码说明~简单实用，适用于课堂作业程度(Reverse single linked list provides a set of source code source code and source code ~ ~ simple and practical instructions for classroom work degree)

基于Hash表的程序同源性分析,可以利用本程序进行两个程序源码比较相似度(Homology analysis Hash Table-based program, you can use the program two program source code similarity)

这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

阿当姆斯显式和隐式求解方法，用四阶龙格库塔作为起始，然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中，方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)