test serial port by c++
上传时间： 2013-12-13
上传用户：llandlu
SMS Test application
标签： application Test SMS
上传时间： 2013-12-23
上传用户：zhuimenghuadie
test bed for cs5463 you write into cs5463 and read from it and configurit
标签： 5463 configurit and write
上传时间： 2013-12-25
上传用户：sardinescn
A java code shows how to use dijkstra algorithm it includes a test program and document
标签： algorithm dijkstra document includes
上传时间： 2014-01-15
上传用户：924484786
this is for tinyon to test the Uart
上传时间： 2017-08-18
上传用户：康郎
u-boot for Linux platform. you can test it
标签： platform u-boot Linux test
上传时间： 2014-11-24
上传用户：独孤求源
Test CA-CFAR on FFT of sinusoidal beats with controllable SNR
标签： controllable sinusoidal CA-CFAR beats
上传时间： 2013-12-31
上传用户：daguda
this code is such as a test code of interfacing microcontroller with MMC card
标签： code microcontroller interfacing this
上传时间： 2013-12-16
上传用户：xlcky
LCD FOR 8 BIT INTERFACE, TEST ON SPATAN-3E BOARD
标签： INTERFACE SPATAN BOARD TEST
上传时间： 2014-01-17
上传用户：yangbo69
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
标签： Implementation calculates algorithm Edmonds
上传时间： 2014-01-04
上传用户：kiklkook
