代码搜索:Infinity

找到约 1,499 项符合「Infinity」的源代码

代码结果 1,499
www.eeworm.com/read/165765/10052154

cpp tu.cpp

#include"head.h" #define INFINITY INT_MAX #define MAX_VERTEX_NUM 20 //最大顶点个数 #define MAX_NAME 5//顶点字符串的最大长度+1 typedef int VRType; typedef cha
www.eeworm.com/read/468871/6980802

cpp 中南大学导航.cpp

#define INFINITY 10000 /*无穷大*/ #define MAX_VERTEX_NUM 40 #define MAX 40 #include #include #include #include typedef struct ArCell { int adj; //路径长度 }ArC
www.eeworm.com/read/468871/6980808

cpp 校园导航.cpp

#define INFINITY 10000 /*无穷大*/ #define MAX_VERTEX_NUM 60 #define MAX 60 #include #include #include #include typedef struct ArCell { int adj; //路径长度 }ArC
www.eeworm.com/read/454055/7401976

txt huffman.txt

#include #include #include #define MAXSIZE 100 //所能编译字符最大个数 #define NULL 0 #define ERROR -1 #define TRUE 1 #define FALSE 0 #define OK 1 #define INFINITY 10000
www.eeworm.com/read/330730/12873454

cpp 校园导游系统.cpp

// 校园导游系统.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #define vex 4 #define arc 4 #define max 100 #define INFINITY 45886946 struct view { char name[50]; char intro[200]; }; struct
www.eeworm.com/read/324523/13259733

txt 图的邻接矩阵.txt

#include #include #define INFINITY INT_MAX 999 #define MAX_VERTEX_NUM 20 typedef int AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];/*矩阵类型*/ typedef char VexType[10]; /*顶点类
www.eeworm.com/read/323705/13325874

cpp bianli.cpp

#include #include #include #include #define INFINITY INT_MAX 100 // 最大值∞ #define MAX_VERTEX_NUM 20 // 最大顶点个数 #define ERROR 0 #
www.eeworm.com/read/323703/13325889

cpp guanjianlujing.cpp

#include #include #include #define INFINITY 88 #define MAX_VERTEX_NUM 20 #define MAX_ARC_NUM MAX_VERTEX_NUM*2 #define STACK_INIT_SIZE 100 #define STACKINCRE
www.eeworm.com/read/302498/13833644

h graph.h

#include "Queue.h" //引用队列文件 #define maxSize 50 //定义图的最大顶点数 #define INFINITY 32767 //定义权值最大值 //定义邻接表中的边结点类型 class EdgeLink{ public: int wei
www.eeworm.com/read/402672/11530288

cpp main.cpp

#include #define INFINITY 32767 #define MAX_VEX 20 #define QUEUE_SIZE (MAX_VEX+1) using namespace std; bool *visited; //图的邻接矩阵存储结构 typedef struct{ char *vexs; int arcs[MAX_VE