design LP,HP,B S digital Butterworth and Chebyshev
filter. All array has been specified internally,so user only need to
input f1,f2,f3,f4,fs(in hz), alpha1,alpha2(in db) and iband (to specify
the type of to design). This program output hk(z)=bk(z)/ak(z),k=1,2,...,
ksection and the freq.
[輸入]
圖的頂點(diǎn)個數(shù)N，圖中頂點(diǎn)之間的關(guān)系及起點(diǎn)A和終點(diǎn)B
[輸出]
若A到B無路徑，則輸出“There is no path” 否則輸出A到B路徑上個頂點(diǎn)
[存儲結(jié)構(gòu)]
圖采用鄰接矩陣的方式存儲。
[算法的基本思想]
采用廣度優(yōu)先搜索的方法，從頂點(diǎn)A開始，依次訪問與A鄰接的頂點(diǎn)VA1,VA2,...,VAK, 訪問遍之后,若沒有訪問B，則繼續(xù)訪問與VA1鄰接的頂點(diǎn)VA11,VA12,...,VA1M，再訪問與VA2鄰接頂點(diǎn)...，如此下去，直至找到B，最先到達(dá)B點(diǎn)的路徑，一定是邊數(shù)最少的路徑。實(shí)現(xiàn)時采用隊(duì)列記錄被訪問過的頂點(diǎn)。每次訪問與隊(duì)頭頂點(diǎn)相鄰接的頂點(diǎn)，然后將隊(duì)頭頂點(diǎn)從隊(duì)列中刪去。若隊(duì)空，則說明到不存在通路。在訪問頂點(diǎn)過程中，每次把當(dāng)前頂點(diǎn)的序號作為與其鄰接的未訪問的頂點(diǎn)的前驅(qū)頂點(diǎn)記錄下來，以便輸出時回溯。
#include<stdio.h>
int number //隊(duì)列類型
typedef struct{
int q[20]
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
