搜索资源列表
Longgetuta
- 龙格库塔算法，用于拟合GLONASS的星历数据，15分钟精度在5米之内，可以向前推，也可以向后推！-Runge - Kutta method for fitting the GLONASS satellite ephemeris data, the accuracy of 15 minutes within five meters, can move forward, but also can push back!
mystack1008
- 包括栈的push\\pop,计数，查找等操作，简单易行，适合数据结构的初学者-including Stack push \\ pop, calculators, searching operation is simple, the data structure suitable for beginners
push
- 对于给顶的仓库局,以及仓库管理员在仓库中的位置和箱子的开始位置和目标位置,设计一个解推箱子问题的分支限界法,计算出仓库管理员将箱子从开始位置推到目标位置所需的最少推动次数.
nsycomm
- 使用堆排序实现Pop, Push的算法. Push: 最小的元素永远位于堆顶
houzhuishi2
- \"栈顶运算符为: ％c\\n\",getTop(optr)) printf(\"此时运算符为:％c\\n\",e) printf(\"栈顶运算符优先级低,％c进栈\\n\",e) push(optr,e) //e进运算符栈
Stack
- 堆栈的实现代码，实现了栈的所有功能，PUSH，POP，插入，销毁，清空等，有调试程序，可以很清楚的看到栈的运行过程
树的问题（生成）
- ADT BinaryTree 的实现及验证程序采用的主要数据结构：二叉树、栈、队算法思想：1、 先序建树、输出树、后序遍历用递归方法。性能分析：O( n )2、 先序遍历、中序遍历：性能分析：O( n )(1) 若遇到新节点非空则先入栈，然后访问其左子树。(2) 若为空则将栈顶结点出栈，访问其右子树。(3) 循环1、2直到栈为空且无节点可入栈。先序与中序的区别是：先序在入栈时访问节点，中序在出栈时访问节点。3、 层遍历：性能分析：O( n )(1) 根节点入队(2) 节点出队并访问(3) 若节点
查找向量容器中的两个字符串
- 编程实现如下功能：在主函数中，使用find()函数查找向量容器中的两个字符串，然后使用排序算法sort对查找到的两个字符串之间的所有字符串进行排序操作，最后输出排序后的向量容器中的字符串。其中函数push用于生成一个包含12个字符串的向量，函数disp用于输出向量容器中的字符串。,Programming to achieve the following functions: the main function, use the find () function to find Vector co
flowofdistribution33nodes
- 此程序为MATLAB实现的配电网33节点潮流计算，方法为前推回代法。-MATLAB realization of this program for the distribution network 33 nodes in power flow calculation, and methods for the former to push back on behalf of the law.
Stack
- This a Stack Class with Funtions Push,Pop, check Stack is Full or Empty Application: Change a number from Decimal to Binary-This is a Stack Class with Funtions Push,Pop, check Stack is Full or Empty Application: Change a number from
SmcSrc_5_1_0
- SMC takes a state machine stored in a .sm file and generates a State pattern in twelve programming languages. Includes: default transitions, transition args, transition guards, push/pop transitions and Entry/Exit actions. See User Manual for more inf
Stack
- 简单模拟栈的操作：包括栈的初始化，压栈，栈顶元素弹出以及取栈顶元素；采用C实现-Analog stack easy steps: including the stack initialization, push, pop elements as well as the Top-Top-check elements implementation using C
Ex1
- 自己实现的栈，包括push,pop,empty等各种算法。-my stack class.It has been compiled successfully and it has all the methods required such as push,pop and so on.
Code
- 最大流的压入与重标记算法,最短路程，最大费用的算法，-The Push-Relabel Algorithm max/min cuts
MaxFlow_PushRelabeledAlgorithm
- Push&Relabeled algorithm to find the optamal flow on the graph
hipr
- 使用push-relabel方法求解最大流问题，是国外的一个研究机构编写的，速度很快。-This is an efficient implementation of the push-relabel method. See Goldberg and Tarjan, "A New Approach to the Maximum Flow Problem," J. ACM Vol. 35, 921--940, 1988 and Cherkassky and Gol
push-pull_entrada_corrente
- calculus to make a push pull power supply
MATLAB-Plot-with-push-buttons
- MATLAB绘图界面具有按钮功能,内容注解使用繁体中文-MATLAB graphics interface with push button functionality, content annotation using the Traditional Chinese.
Push-Pull-Converter
- This the push-pull converter simulation using matlab-This is the push-pull converter simulation using matlab
push-relabel
- （push-relabel）预流推进重标签算法的C语言详细描述-(Push-relabel) Preflow promote weight label algorithm C language described in detail