<pre id="ikiwc"></pre> 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.
標(biāo)簽： Implemented following compile command
上傳時(shí)間： 2014-01-01
上傳用戶：lhc9102
一個(gè)簡單的ＳＰＩ ＩＰ核，SPI Core Specifications 可以從說明文檔中找到！ The simple Serial Peripheral Interface core is an enhanced version of the Serial Peripheral Interface found on Motorola s M68HC11 family of CPUs. The Serial Peripheral Interface is a serial, synchronous communication protocol that requires a minimum of 3 wires. FEATURES: · Compatible with Motorola’s SPI specifications · Enhanced M68HC11 Serial Peripheral Interface · 4 entries deep read FIFO · 4 entries deep write FIFO · Interrupt generation after 1, 2, 3, or 4 transferred bytes · 8 bit WISHBONE RevB.3 Classic interface · Operates from a wide range of input clock frequencies · Static synchronous design · Fully synthesizable
標(biāo)簽：
上傳時(shí)間： 2015-09-17
上傳用戶：TRIFCT
Enter what day the first letter to a judgment as of the week, if the first letter, continue to judge the second letter.
標(biāo)簽： letter the first continue
上傳時(shí)間： 2015-10-06
上傳用戶：gdgzhym
This paper presents several low-latency mixed-timing FIFO (first-in–first-out) interfaces designs that interface systems on a chip working at different speeds. The connected systems can be either synchronous or asynchronous. The designs are then adapted to work between systems with very long interconnect delays, by migrating a single-clock solution by Carloni et al. (1999, 2000, and 2001) (for “l(fā)atency-insensitive” protocols) to mixed-timing domains. The new designs can be made arbitrarily robust with regard to metastability and interface operating speeds. Initial simulations for both latency and throughput are promising.
標(biāo)簽： mixed-timing low-latency interfaces first-out
上傳時(shí)間： 2015-10-08
上傳用戶：dapangxie
This a simple example project for the MSP430 series MCU and the GCC port of the mspgcc project. The project contains a makefile and uses assembler and C sources. It shows a clock on an character LCD.
標(biāo)簽： project the example simple
上傳時(shí)間： 2015-10-19
上傳用戶：waitingfy
Delphi and C++ Builder component for direct access to IO ports on Windows 95, Windows 98 and Windows NT/2000. Provides properties for reading and writing bytes, words and doublewords from/to IO ports. New fast block data transfer methods enable to read and write megabytes of data per second.
標(biāo)簽： Windows and component Builder
上傳時(shí)間： 2015-10-25
上傳用戶：bjgaofei
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
SAM9261 BasicMMU Example code with ADS1.2 (163 kB) The goal of this project is to show how to use a PC100 SDRAM and the MMU to perform a rating with a 100MHz Bus Clock. The rating is based on Dhrystone 2.1. It shows the rate when I+D Caches are disabled or enabled, with or without MMU and I Cache is disable or enabled, with or without MMU.
標(biāo)簽： BasicMMU Example project 9261
上傳時(shí)間： 2013-12-28
上傳用戶：zhanditian
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
