代码搜索：卡尔曼算法
找到约 10,000 项符合「卡尔曼算法」的源代码
代码结果 10,000
www.eeworm.com/read/381365/9095763
txt 赫夫曼.txt
#include
#include
using namespace std;
int a[100]; // 用来存放编码的数组
int maxsize(0); // 用来记录编码的长度
static int count; // 用来记录字符的长度
int number(0); //存放字符串的长度
class node // 存放
www.eeworm.com/read/350664/10720769
doc 哈夫曼.doc
www.eeworm.com/read/271645/10985801
cpp 赫夫曼.cpp
#include "huffman.h"
bool main ()
{
string filename;
char bd;
int chfm=0;
huffman *a=NULL;
while(1)
{
system("cls");
cout
www.eeworm.com/read/270654/11030986
哈夫曼编码
www.eeworm.com/read/468529/6992512
doc 哈夫曼.doc
www.eeworm.com/read/297768/7997262
cpp 哈夫曼.cpp
/* 函数结果状态代码 */
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
/* #define OVERFLOW -2 因为在math.h中已定义OVERFLOW的值为3,故去掉此行 */
typedef int Status; /* Statu
www.eeworm.com/read/245433/12800211
txt 曼码解码.txt
-- File Name: me.vhd
-- Model: Manchester Encoder Chip
library ieee ;
use ieee.std_logic_1164.all ;
use ieee.std_logic_arith.all ;
use ieee.std_logic_unsigned.all ;
entity me is
port (rs
www.eeworm.com/read/316643/13519591
cpp 哈夫曼.cpp
#include
#include
#define N 10 /*待编码字符的个数，即树中叶结点的最大个数*/
#define M 2*N-1 /*树中总的结点数目*/
typedef struct{
unsigned int weight;
unsigned int parent,lchild,rchild;
}HTNode
www.eeworm.com/read/403239/11520520
dsp 哈夫曼.dsp
# Microsoft Developer Studio Project File - Name="哈夫曼" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Conso
www.eeworm.com/read/403239/11520523