搜索资源列表
eno&weno.rar
- 数值计算程序，基于非结构有限体积法的eno和weno的计算格式.-Numerical procedure, based on the volume of non-structural priority issue
图的深度优先周游_递归_邻接矩阵
- 图的深度优先算法，这个算法非常的实用，应该经常被用到-map the depth priority algorithm, the algorithm is very practical, should always be used
BDFS
- 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
chenbo广度
- 人工智能运用广度优先算法来解决八数码问题,由初始状态到目标状态按层搜索-breadth priority use of artificial intelligence algorithms to solve eight digital issue, the initial state to the target state by layer Search
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such
简单的表达式求值
- 语法分析正确后就可以求值了，求值时用到一个操作数堆栈和操作符堆栈，以及一个算符优先表（存储了运算符之间的优先关系），具体细节可以阅读源码。-syntax analysis is correct after it evaluates the value used for a number of operations and the operator stacks stack, and an operator priority list (stored Operators relations bet
20051004深度优先 人工智能 八数码
- 人工智能中很重要的思想，用深度优先的思想解决八数码问题。-AI is very important idea, with priority to the depth of eight digital thinking to solve problems.
0801
- 功能：构造图，并进行图的深度优先遍历（邻接表存储结构），图的广度优先遍历，内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of the source code
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
priority_queue
- Priority queue use the structure priority_queue in C++ and realization functions. All methods write in Korman
BERd2
- 在不同的信道条件下计算第一类优先级数据平均频谱效率的MATLAB函数-In different channel conditions, the first class priority data calculated the average spectral efficiency of the MATLAB function
PRIORITY
- Priority scheduling algorithm in C
sRtree
- 快速动态优先搜索树的实现Rapid implementation of dynamic priority search tr-Rapid implementation of dynamic priority search tree
priority-queue
- data structure program in c to implement priority q-data structure program in c to implement priority queue
two-priority-methods
- 这个是一个比较基础的东西，比较适合初学者来学习，同时，最小二乘法是一个很不错的拟合方法-two priority methods-least logarithm square method
priority-queue
- 使用循环队列创建最小和最大优先队列，并使用堆排序方法去排序。-Using the circular queue to create the min and max priority queue, and using heap sort method to sort the queue.
priority-based-method-
- robocup rescue 机器人救援仿真参考论文 非预案方式下警力分配模型的研究与仿真（基于优先级的警察智能体的构建方法，周诚）-robocup rescue robot rescue simulation mode reference paper non-plan allocation model of police and Simulation (priority-based method of constructing the police agent, Zhou Cheng)
priority
- 操作系统中高优先权优先调度算法 可用于操作系统课设，是调度算法中重要部分-Operating system a high priority priority scheduling algorithm can be used class-based operating system, it is an important part of the scheduling algorithm
priority-queue
- 优先队列 数据结构与算法 哈工大软件设计与开发 优秀代码 分享交流-hit code priority queue
The-priority-method-for-UC
- 尝试利用优先顺序法解决机组组合问题。数据是1024节点的~-Try to take advantage of priority method to solve the problem of unit combination.