See Appendix B for a description of the programs included
on this companion disk. RESOURCE.WRI identifies other books
and resources for Internet programming. WEBHELP.HLP contains
an introduction to the World Wide Web. TCPMAN.HLP provides
detailed instructions to help you use the Trumpet Winsock
included on this disk. Use the Program Manager s File menu
Run option to execute the SETUP.EXE program found on this
disk. SETUP.EXE will install the programs on your hard drive
and create an Internet Programming group window.
Internet編程技術(shù) [配套程序]
[涉及平臺] VC
[作者] void
[文件大小] 1032K
* "Copyright (c) 2006 Robert B. Reese ("AUTHOR")"
* All rights reserved.
* (R. Reese, reese@ece.msstate.edu, Mississippi State University)
* IN NO EVENT SHALL THE "AUTHOR" BE LIABLE TO ANY PARTY FOR
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT
* OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE "AUTHOR"
* HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
About:
hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases.
Release focus: Major feature enhancements
Changes:
This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download.
Author:
cruppstahl
Floyd-Warshall算法描述
1)適用范圍：
a)APSP(All Pairs Shortest Paths)
b)稠密圖效果最佳
c)邊權(quán)可正可負
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法結(jié)束：dis即為所有點對的最短路徑矩陣
3)算法小結(jié)：此算法簡單有效，由于三重循環(huán)結(jié)構(gòu)緊湊，對于稠密圖，效率要高于執(zhí)行|V|次Dijkstra算法。時間復雜度O(n^3)。
考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設(shè)成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍色部分，可以更直觀地得到I,j的連通情況。
This document describes how to switch to and program the unisersal serial bus (USB)
analog phase-locked loop (APLL) on the C5506/C5507/C5509A devices. Example
assembly programs for programming and switching to and from the APLL are also
provided in the attached zip file. It is assumed that the reader is familiar with the use
and operation of the C5506/C5507/C5509A USB digital phase-locked loop (DPLL) and
C55x™ Digital Signal Processor (DSP) IDLE procedures.
basic.c */
/**//* Project:NeuroBasic, basic package*//**/
/* Survey:This is a simple Basic b-code compiler which*/
/*can be used as a comfortable command shell for */
/* any program. The actual compiler is found in */
/*compiler.c.*/
/*The functions m_fctptr() and user_server()*/
/*build an interface to an
