esdds g s g f dg dgd fgdfg fd
上传时间： 2015-07-23
上传用户：hwl453472107
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
gfdg fdfdgdfgfd g fdg df gd fgfdg fd
标签： fdfdgdfgfd fgfdg gfdg fdg
上传时间： 2015-09-27
上传用户：xz85592677
考察例1 4 - 8中的1 4个点。A中的最近点对为(b,h)，其距离约为0 . 3 1 6。B中最近点对为 (f, j)，其距离为0 . 3，因此= 0 . 3。当考察 是否存在第三类点时，除d, g, i, l, m 以外 的点均被淘汰，因为它们距分割线x= 1的 距离≥ 。RA ={d, i, m}，RB= {g, l}，由 于d 和m 的比较区中没有点，只需考察i 即可。i 的比较区中仅含点l。计算i 和l 的距离，发现它小于，因此(i, l) 是最近
标签：
上传时间： 2013-12-03
上传用户：66666
C G I又称通用网关接口(Common Gateway Interface)，是外部程序和We b服务器之间的标 准编程接口， P H P隐藏了其中的大部分复杂性，但是，了解一些它的基本内容对设计应用程 序和进行调试都有很大帮助。
标签： Interface Gateway Common 网关
上传时间： 2015-11-26
上传用户：大三三
fgf gfdg fd g dfg df g
上传时间： 2014-12-06
上传用户：zhangyi99104144
A* sudo sudo/* B* adduser script adduser C* rmuser script rmuser E* tout tout/* F* dumdum dumdum G* lostfile lostfile H* Mkfl.localsys Makefile.localsys I* spacegripe spacegripe J* sendmail.cf sendmail.cf N* remote remote.c O* distributed conrol distrib/* P* hosts and name server makerevhosts Q* xargs xargs/*
标签： adduser script rmuser sudo
上传时间： 2016-03-29
上传用户：gxrui1991
DESCRIPTION : BIN to seven segments converter -- segment encoding -- a -- +---+ -- f | | b -- +---+ <- g -- e | | c -- +---+ -- d -- Enable (EN) active : high -- Outputs (data_out) active : low
标签： DESCRIPTION converter segments encoding
上传时间： 2016-08-17
上传用户：ainimao
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
标签： Subsequence sequence Problem Longest
上传时间： 2016-12-08
上传用户：busterman
ITU-T G.729 Annex C+ - Reference C code for floating point implementation of G.729 at 6.4/8/11.8 kbit/s with DTX functionality (integration of Annexes B, D and E)
标签： implementation 729 Reference floating
上传时间： 2017-04-10
上传用户：cccole0605
