贝塞尔曲线的实现

精通DirectX图形编程的源代码，包含28，29两个章节-Proficient in DirectX graphics programming source code, contains two chapters 28,29

设计一个电子投票平台软件，该电子投票平台软件为用户提供一个在Windows系统上运行的电子投票、票数统计的软件平台。 投票人主要功能如下： ①投票人的投票方式 ②投票人了解候选人的方式 管理人员的主要功能如下： ①初始化候选人信息 ②浏览候选人简介 ③修改候选人简介 ④查询投票情况-Design of an electronic voting platform software, the electronic voting platform software provides users with a Windows system running on electronic voting, the tallies of the software platform. Voters main functions are as follows: ① voters voting ② voters about the candidates the way The main functions of management are as follows: ① Initialize candidate information ② View Candidates ③ modify Candidates ④ query voting

Branch and Bound 算法实现.用以快速搜索一个区域.-Branch and Bound algorithm. Quick search for a regional.

one-time pad的算法有以下要求：1、密钥必须随机产生2、密钥不能重复使用3、密钥和密文的长度是一样的。-one-time pad algorithm has the following requirements : 1, key must produce two random, not repeated use of key three, key and the ciphertext is the same length.

这是一个红绿灯小程序，看了会有用哦，主要用于新手上路。-This is a traffic light small program will read with, oh, mainly for Getting Started.

MFC写的窗体,适合于想了解MFC结构的学习者-MFC written forms, suited to want to know the structure of learners MFC

由用户输入系统进程数(最多50个进程)来模拟优先级调度算法假设进程是同时到达CPU，进程运行时间(1-10秒)和进程优先级 (1-10，10最高1最低)由程序随机产生，进程有2种状态就绪状态（Ready）和完成状态(Complete)首先根据优先级对进程进行排序，再根据优先级分配时间片运行每次分给进程的时间片为1秒，运行完后需运行时间减1优先级减1转下一个进程。如果进程已经完成就插入到完成队列，如果没有完成就重新插入到就绪队列中的正确位置 程序有两种运行方式： 1、可以直接给出最后的运行结果，进程最后的优先级、 运行完每一个进程的时间及完成进程的总时间，进程最后的状态。 2、可以选择自动运行，过程中显示每一次调度信息包括本次调度进程完成队列信息就绪队列信息等*/ -Process user input from a number of systems (up to 50 processes) to simulate priority scheduling algorithm is the assumption that the process of arrival at the same time CPU, the process of run-time (1-10 seconds) and the process priority class (1-10,10 highest minimum 1) randomly generated by the process, the process has two kinds of status status ready (Ready) and achieve status (Complete) First of all, the process in accordance with the priority ranking, and distribution in accordance with the priority of each time slice to run to the process time slice for the second one, to be run after run-time priority class minus one minus one to t

最小费用最大流的一个实验程序,可以根据具体问题来重新修改-Minimum cost maximum flow in an experimental procedure may be based on specific issues to re-modify the

用于已知栅格环境下机器人路径规划的Astar算法源码-known for raster environment robot path planning algorithm Astar FOSS

能显示文件盘符路径和文件的大小，创建时间，类似于dos里面dir的命令，并且可以扩展-can show that the document drive path and file size, creation time, similar to the dos inside the dir command, and can be extended