提前登录系统

HANOI 塔问题求解.cpp，HANOI 塔问题是数据结构中具有典型的代表性问题-HANOI tower question solution cpp, the HANOI tower question is in the construction of data has the model the representative question

带通配符的字符串匹配算法源代码-with wildcard string matching algorithm source code

dfgdsfg sdfg dsfg dfsg dsfg dsfg sdf gsdg sdg sdfg sdgdsfg

数据结构大作业的非界面版-large data structure of the non-operational interface version

图论与网络论中求最短路径的Dijkstra算法-Graph theory and network theory for the Dijkstra shortest path algorithm

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

Tutorial on data access using store procedure for MSSQL

此代码是一个数据结构课程设计――飞机订票系统.-this code is a data structure course design-- aircraft booking system.

描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.

随机输入n跳直线 利用增量算法 在一个方块区域内实现他的dcel图 利用opengl把效果图展示出来 -Stochastic input n-hop linear incremental algorithm in a box to use within the region to realize his plan to use opengl to dcel effect diagram displayed