文件名称:Program1WireRourtingFall2014
- 所属分类：
- Linux/Unix编程
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2015-01-14
- 文件大小：
- 49kb
- 下载次数：
- 0次
- 提 供 者：
- Eric*****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
WireRourting布线程序
给定一个矩阵，里面有1和0,0代表可通过，1代表不可通过，给定一个start position，要求找到target position的最短路径-WireRourting
A common approach to the wire routing problem for electrical circuits is to impose a grid over the wire
routing region. The grid divides the routing region into an m x m array of squares. A wire runs from
midpoint of one square S to the midpoint of another T. In doing so, wire may take right angle turns.
Grid squares which already have wire through them are blocked. To minimize the signal delay we wish
to route the wire using shortest path between S and T.
给定一个矩阵，里面有1和0,0代表可通过，1代表不可通过，给定一个start position，要求找到target position的最短路径-WireRourting
A common approach to the wire routing problem for electrical circuits is to impose a grid over the wire
routing region. The grid divides the routing region into an m x m array of squares. A wire runs from
midpoint of one square S to the midpoint of another T. In doing so, wire may take right angle turns.
Grid squares which already have wire through them are blocked. To minimize the signal delay we wish
to route the wire using shortest path between S and T.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Program1WireRourtingFall2014\main
............................\main.cpp
............................\main.o
............................\Makefile
............................\Position.cpp
............................\Position.h
............................\Position.o
............................\Program1WireRourtingFall2014.pdf
............................\Queue.cpp
............................\Queue.h
............................\Queue.o
............................\sample.txt
............................\sample_grid
............................\WireRouting.cpp
............................\WireRouting.h
............................\WireRouting.o
Program1WireRourtingFall2014