搜索资源列表
maxflow
- 关于网络流的一些代码，解题报告有最大流，最小费用最大流等-On a number of network flow code, problem-solving report maximum flow, minimum cost maximum flow, etc.
MC-Solve
- 野人与传教士问题的求解程序，对N=3，K=2给出正确路径-Savage with the missionary problem solving procedures, N = 3, K = 2 are given the correct path
report
- poj解题报告，包括了许多很经典的算法-POJ problem solving reports, including a number of classic algorithms
vrp
- 本人原创的用遗传算法实现的vrp问题求解，基于matlab语言-I original genetic algorithm is used to achieve the vrp problem solving, based on the matlab language
MATLAB-math
- 高等应用数学问题MATLAB求解习题参考解答 ,薛定宇(pdf版本)-Higher applied mathematics problem solving exercises MATLAB Solutions, Xue Dingyu (pdf version)
zoj_1013_Great_Equipment
- 这是一道经典的DP题目，如果不做就太遗憾了，我刚开始没有做出来，后来看了别人的解题报告才做出来的-This is a classic topic of DP, if not too sorry, I did not do it just started, after reading other people' s problem-solving done by the report of
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
tabu_search-Solve-the-TSP-problem
- 基于禁忌搜索算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Tabu search algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
ant_colony_system-Solve-the-TSP-problem
- 基于蚁群算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Ant colony algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
TSPBranchAndBound
- TSP TRAVEL SALES MAN PROBLEM SOLVING
8number
- 使用 人工智能里面的 A算法 解决八数码问题 使用C语言进行编写的-A method using artificial intelligence inside the eight-puzzle problem solving using the C language written in
swarm_optimization-Solve-the-TSP-problem
- 一个基于粒子群优化算法源码,（PSO）的50个城市TSP问题的求解，可推广至类似NP.-A source code based on particle swarm optimization, (PSO) of the 50 cities TSP problem solving, can be extended to similar NP.
3-problem-solving11
- Problem solving techniques in artificial intelligent subject
MaxClique
- Miscrosoft Visula Studio .NET + C++求解最大团问题，并比较了求解最大团问题的几种算法。-Miscrosoft Visula Studio. NET+ C++ solve the maximum clique problem, and compared the maximum clique problem solving algorithms.
problem-solving
- 各种问题算法，包括，N皇后问题回溯算法，动态计算网络最长最短路线，货郎担界限，矩阵乘法动态规划等-Algorithm for various problems, including, N Queens problem backtracking algorithm, dynamic network of the longest shortest path computation, Traveling Salesman boundaries, such as dynamic programming
Infinite-problem
- Markov Decision Progresss中的无限维问题求解仿真实例。-Markov Decision Progresss problem solving in the infinite-dimensional simulation.
maze-problem
- 实现迷宫问题的求解：以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。-Achieve maze problem solving: a long-m* n matrix that maze, 0 and 1, respectively, in the maze of paths and obstacles. Design a program, for any set of the maze, find
Blocks-Problem
- 中山大学sicily题库的一道题，解题思路明了，非常简单！-Sun Yat-sen University sicily exam a question, problem-solving Si Luming, very simple!
The-solving-report-of-ACM-problems
- ACM经典题目的解题报告，题目汇总全面，解析详尽。-ACM classic topic of problem solving report, entitled Summary comprehensive, analytical and detailed.
Joseph-problem
- 利用循环链表实现约瑟夫问题的求解。 约瑟夫问题如下：已知n个人（n>=1）围坐一圆桌周围，从1开始顺序编号。从序号为1的人开始报数，顺时针数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规则重复下去，直到所有人全部出列。请问最后一个出列的人的编号。 -Circular linked list Joseph problem solving. Joseph questions are as follows: Given n individuals (n>