A .NET Path Finder Library Path Finder Library is a .NET library that currently contaIns one type called SimplePathFinder. SimplePathFinder is a very simple and basic implementation of the A* path finding algorithm. It is extremely easy to use and integrate in your applications. It works very well and I hope you enjoy using it. 這是一個(gè)用C#實(shí)現(xiàn)的路徑搜索算法，實(shí)現(xiàn)的了簡單的A*算法！
標(biāo)簽： Library Finder Path NET
上傳時(shí)間： 2013-12-14
上傳用戶：hullow
AutoSummary contaIns the JWords Java Interface for WordNet, and you will need to edit the JWords configuration file to provide a path to the WordNet command line interface.
標(biāo)簽： JWords AutoSummary Interface the
上傳時(shí)間： 2015-10-09
上傳用戶：lmeeworm
stk接口 This file contaIns a summary of what you will find in each of the files that make up your work application.
標(biāo)簽： contaIns summary files This
上傳時(shí)間： 2015-10-09
上傳用戶：ywqaxiwang
-- Booth Multiplier -- This file contaIns all the entity-architectures for a complete -- k-bit x k-bit Booth multiplier. -- the design makes use of the new shift operators available in the VHDL-93 std -- this design passes the Synplify synthesis check
標(biāo)簽： entity-architectures Multiplier contaIns complete
上傳時(shí)間： 2014-01-22
上傳用戶：lijianyu172
This file (the project file) contaIns information at the project level and is used to build a single project or subproject. Other users can share the project (.dsp) file, but they should export the makefiles locally.
標(biāo)簽： project file information the
上傳時(shí)間： 2013-12-07
上傳用戶：hj_18
％The Metabolic Networks Toolbox contaIns functions to create, ％modify, display, and simulate biochemical reaction networks.
標(biāo)簽： Metabolic functions Networks contaIns
上傳時(shí)間： 2015-10-26
上傳用戶：wangyi39
Input The first line of the input contaIns a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contaIns N, and the second line contaIns N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won t be more than 1000 people and nobody takes more than 100 seconds to cross. Output For each test case, print a line containing the total number of seconds required for all the N people to cross the river. Sample Input 1 4 1 2 5 10 Sample Output 17
標(biāo)簽： the contaIns integer number
上傳時(shí)間： 2015-10-27
上傳用戶：plsee
Input The input contaIns blocks of 2 lines. The first line contaIns the number of sticks parts after cutting, there are at most 64 sticks. The second line contaIns the lengths of those parts separated by the space. The last line of the file contaIns zero. Output The output should contaIns the smallest possible length of original sticks, one per line. Sample Input 9 5 2 1 5 2 1 5 2 1 4 1 2 3 4 0 Sample Output 6 5
標(biāo)簽： contaIns The blocks number
上傳時(shí)間： 2015-10-27
上傳用戶：lepoke
Input The input consists of two lines. The first line contaIns two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line. Output There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values. Sample Input 8 3 1 3 -1 -3 5 3 6 7 Sample Output -1 -3 -3 -3 3 3 3 3 5 5 6 7
標(biāo)簽： The two consists contaIns
上傳時(shí)間： 2014-12-21
上傳用戶：hongmo
It support IPv4 and IPv6 unicast and multicast and contaIns a trivial sender and a trivial receiver that can be used to send or receive arbitrary data over RTP. An implementation of generic forward error correction is planned, t
標(biāo)簽： and trivial multicast contaIns
上傳時(shí)間： 2013-12-14
上傳用戶：金宜
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
