代码搜索:通讯源程序
找到约 10,000 项符合「通讯源程序」的源代码
代码结果 10,000
www.eeworm.com/read/321865/13394156
pdf visualc源程序.pdf
www.eeworm.com/read/318119/13488558
doc 源程序清单.doc
www.eeworm.com/read/313698/13582344
doc 源程序封面.doc
www.eeworm.com/read/313438/13587591
txt 07源程序.txt
#include "stdafx.h"
#include "winsock2.h"
#include "ws2tcpip.h"
#include "iostream.h"
#include "stdio.h"
typedef struct _IP_HEADER
{
union
{
BYTE Version;
BYTE HdrLen;
};
BYTE S
www.eeworm.com/read/313434/13587624
txt 10源程序.txt
文件scanhost.h
/////////////////////////////////////////////////////////////////////
#pragma pack(4)
#pragma comment(lib,"Ws2_32.lib")
#define WIN32_LEAN_AND_MEAN
#include
#include
www.eeworm.com/read/313428/13587863
txt 02源程序.txt
#include
#include
void main(int argc,char *argv[])
{
FILE *fp;
char ch;
unsigned char chrl,chrh;
unsigned int count=0,checksum=0,chr=0;
unsigned long int sum=0;
if(
www.eeworm.com/read/313031/13598202
txt tsp源程序.txt
TSP问题的遗传算法+转载
我这几天做了一个队员选择问题,其中一个问题我是用遗传算法做的,现在我把它整理成解决tsp问题的遗传算法:旅行商问题(traveling saleman problem,简称tsp):
已知n个城市之间的相互距离,现有一个推销员必须遍访这n个城市,并且每个城市只能访问一次,最后又必须返回出发城市。如何安排他对这些城市的访问次序,可使其旅行路线的总长度最短? ...
www.eeworm.com/read/307801/13714920
txt 算法源程序.txt
#include
#define M 42
#define N 20
int CalcheckinValue(double CB[],double **matrix,double checkin[],double Z[],int m,int Row)
{
int i,j,n=-1;
double Min=0;
double var;
dou
www.eeworm.com/read/302168/13840122
c 红外源程序.c
/*遥控接收在此中断程序内完成
//遥控码放在ir_da[]中
/************************************/
/* Interrupt for IR subroutine */
/* external interrupt source INT0 */
/************************************/
//#inc
www.eeworm.com/read/490863/6443396