搜索资源列表
8puzzle
- 8puzzle game by Java This program can automatically solve 8 puzzle games with Manhattan approach and show each step.
EightDigits
- 八数码，启发式，曼哈顿距离，A*算法实现-Eight digital, heuristic, Manhattan distance, A* algorithm
DistanceTransform
- 距离变换，用chamfer方法，实现栅格距离变换、曼哈顿距离变换和棋盘距离变换-Distance transform method with a chamfer distance transform of Grid, Manhattan distance and the chessboard distance transform transformation
3133
- pku 3133 Manhattan Wiring 连通性状态压缩DP-pku 3133 Manhattan Wiring connectivity state of compression DP
mobility_generator
- These mobility generator tools are used to generate a rich set of mobility scenarios used to evaluate the protocol performance in Mobile Ad Hoc Network. The tools include the Reference Point Group Mobility(RPGM) model, Freeway Mobility Model and
EightPuzzle
- Solve the 8-puzzle problem using A * algorithme. Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank. There are 2 Heuristic: 1. N: Number of misplaced tiles 2. S: Sum o
gcl.src.tar
- BOI version of Steiner tree construction, practical and popular for manhattan VLSI routing, generate a Steiner minimum tree for given set of terminals in a layout plane-BOI version of Steiner tree construction, practical and popular for manhattan VLS
mobile_traces_rpgm
- 适用于ns2仿真的移动trace生成工具（C环境）-These mobility generator tools are used to generate a rich set of mobility scenarios used to evaluate the protocol performance in Mobile Ad Hoc Network. The tools include the Reference Point Group Mobility(RPGM) model, Fr
MonteCarlo-ppt-sample
- 蒙特卡罗(Monte Carlo)方法，又称计算机随机模拟方法，是一种基于"随机数"的计算方法。这一方法源于美国在第二次世界大战研制原子弹的曼哈顿计划。该计划的主持人之一数学家冯诺伊曼用驰名世界的赌城-摩纳哥的Monte Carlo来命名这种方法。-Monte Carlo (Monte Carlo) methods, also known as computer-generated random simulation method is based on " random number&
Manhattan_skylines
- 最高效的实现了整型数据间的Manhattan skylines问题-Achieve the most efficient integer data problem between the Manhattan skylines
mg
- Bash scr ipt to generate different scenario for Manhattan Grid mobility from bonnmotion
Manhattan
- 在 VLSI 设计中,多点互连是物理设计阶段的关键问题之一,而互连的点数等于 2 或大于 2 分别对应于 Manhattan 空间上有障碍时的最短路径问题和最小 Steiner 树问题,显然前者是后者的基础.连接图是研究最短路径 问题的有效工具,已有的典型连接图包括基于轨迹的GC 和GT 以及基于自由区的GF 和GG.工作包括3个方面:设计并分析了在各种连接图上实现动态的点对之间的最短路径查询算法 分析了在各个连接图上构造 3-Steiner 树的算 法,对于已有的 GC 上的 3-
Manhattan_distance.py
- The compute of Manhattan Distance
FindRouteGUI
- 1，已完成功能 （1）距离短时大部分情况下可以选择最短路径进行移动 （2）加入了精英选择优化算法 （3）无论地图大小一定可以得出路径 （4）点击障碍物可以得出路径 3,代码改进 将原来两大类（Widget，Geno）拆分成三个类（Widget，Handle，Geno）， Widget：显示界面等可视化元素，获取最短路径并显示移动， Handle：优化路径，得出最短路径，以后会加入通信模块 Geno：计算得出一定数量的可达路径 4，算法描述
fiifteen_puzzle
- Program implements graphs algorihtms to solve fifteen puzzle problem (http://en.wikipedia.org/wiki/Fifteen_puzzle). There are few methods BFS - Hamming and Manhattan heuristics, Breadth-first search and Depth-first search. You can implement A* algori
jvzhen
- Descr iption 给定一个r * c的只包含0和1两个数字的矩阵，对于矩阵中任意一点(x,y)，定义(x,y)的权为(x,y)到与此点曼哈顿距离最小的1的曼哈顿距离（如果mat[x][y] = 1,则(x,y)的权为0）。请求出对于给定01矩阵中所有点的权值之和。 Input 输入包含多组数据，每组数据第一行为两个整数r, c(0 < r, c < = 1000)。 接下来 r 行每行有 c 个整数，且保证只能为0或者1（保证矩阵中含有至少
ThreadTree
- 线索二叉树，能帮助我们快速的建立二叉树，不需要重复代码，这样会使得设计者更加的轻松-ThreadTree is a BinaryTree which is converinint to built a BinaryTree , everyone wants to learn it , it really can help us ，we also learn how to build a BinaryTree.lt was a cool fall afternoon in Manhattan. T
TDistManhattan
- Source for distance transform (manhattan)
manhattan.tar
- TCL scr ipt for simulation of wireless nodes with Manhattan mobility for 22 nodes. You need and additional file(a mobility scenerio file in this case) for success output.
Manhattan-loop-genetic-algorithm
- Manhattan回路—遗传算法求解，用遗传算法解哈密顿回路的c++ -Manhattan loop genetic algorithm