搜索资源列表
数据结构系列数学问题
- 数据结构系列常见数学问题代码集锦，包括猴子分桃，百鸡百钱等一系列经典问题-series of common data structure code Collection mathematical problems, including monkeys- peach, 100 chickens hundred classic series of money problems
货担郎问题
- 货担郎问题，求两点间最短路径。单源最短路径的求取。-goods, for the shortest path between two points. Single-source shortest path to the strike.
mazh
- 旅行商问题的算法，采用分枝限界。网上都只有算法描述，没有实现，这里给出了完整实现，并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm descr iption, failed to materialize here is the realization of complete, and packaged as a category.
工程工期控制问题
- 问题描述：已知某工程分解为11个子工程（P1，P2，…,P11），每个子工程的工期，各自工程以及各子工程与总工程之间的关系如下图所示。现在想缩短该工程的总工期，问要缩短那些子工程的工期，才能达到缩短该工程总工期的目标？-Problem descr iption : decomposition of a project known as 11 sub-projects (P1, P2, ..., P11), each for the pr
travelingsalesman
- 用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正-dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction
动态规划----矩阵连乘问题
- 动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(i<j)表示矩阵Mi连乘到Mj的最小工作量 3）下方元素Di,j(i>j)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通
QUEues皇后问题
- 此程序完成N皇后问题。大家可以互相讨论学习。-N Queen's problem. We can learn from each other discussions.
读者写者算法
- 关于读者写者的问题，分别实现读者优先和写者优先．-readers to write on the issue, the readers who wrote a priority and priority.
aiprogram
- 两个人工智能小程序，解决八数码问题，使用A*算法-two small programs to solve eight digital, the use of A* algorithm
bag
- 这个小程序是算法设计与分析方面的,求解背包问题,用的是递归设用的方法,本程序不是本人做的,朋友做的,可以拿来参考一下,不要抄袭,本人尊重版权朋友.-this is a small program algorithm design and analysis, problem solving backpack, it was established with the recursive method, the procedure is no
资源分配问题
- 资源分配问题,n个车间,m台设备,如何分配才能使获最大利益?-resource allocation problem, workshops n, m machines, and the distribution can be best interests
八数码问题
- 一个解决八数码问题的源码，不知道怎么样，多多指教-a digital solution to the problem source, I do not know how kind, exhibitions
分支界限
- 用vc编写的解决计算机算法中的分支限界问题，非常经典的代码，请多多指教！-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend!
lifashi
- 理发师睡觉问题 可以利用它来解决嗜睡的理发师问题 进程调度与信号量问题-Seville sleep problems can use it to solve the problem sleepiness barber process scheduling and capacity problems of signal
猴子选大王的问题键表C
- 一个用C写的猴子选大王问题，是用键表实现的，拿出来和大家讨论一下-a monkey was elected king of the problem by using keys table to achieve, and we like to talk about
猴子选大王的问题键表C2
- 又一个用C语言编写的猴子先大王的问题，也是用键表写的这个简单一点。-also a C language prepared by the first king of the monkeys, as well as bonding with the written form of this simple point.
ReaderWriter
- 操作系统课程设计，关于操作系统经典问题读者写者问题的演示!-courses on operating system design, operating system classic problem of the readers who write the demo!
用循环单链表解决josephus问题的算法
- 用循环单链表解决josephus问题的算法-cyclic single linked list of issues to resolve Josephus Algorithm
读者写者2005
- 这是一个操作系统 的精典算法 ，是关于读者写者问题 的，是用c来模拟的，-This is a classic algorithm operating system is on the readers who wrote in, is to simulate c,
哲学家进餐
- 哲学家进餐问题，描述计算机系统的同步与互斥问题。-dining philosopher, describes the computer system synchronization and mutual exclusion problems.