代码搜索:Infinity

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

代码结果 1,499
www.eeworm.com/read/183326/9169883

c gdc.c

/* * Grand digital clock for curses compatible terminals * Usage: gdc [-s] [n] -- run for n seconds (default infinity) * Flags: -s: scroll * * modified 10-18-89 for curses (jrl) * 10-18-89 add
www.eeworm.com/read/357508/10208101

c gdc.c

/* * Grand digital clock for curses compatible terminals * Usage: gdc [-s] [n] -- run for n seconds (default infinity) * Flags: -s: scroll * * modified 10-18-89 for curses (jrl) * 10-18-89 add
www.eeworm.com/read/162793/10270595

cpp my.cpp

#define UNVISITED 0 #define VISITED 1 #define INFINITY 9999999 #define ROOT -1 #include #include #include "LList.h" #include //数据结构部分: /**************
www.eeworm.com/read/159245/10675832

cpp minispantree_prim.cpp

//MiniSpanTree_Prim.cpp //This function is to create MiniSpanTree_Prim with Prim Algorithm # include # include # include # define INFINITY 1000 # define MAX_V
www.eeworm.com/read/275818/10794771

cpp dfs.cpp

#include #define NULL 0 #define OK 1 #define ERROR 0 #define INFINITY 255 #define MAX_VERTEX_NUM 20 typedef int Status; typedef int ElemType; // ----------------------- 队列结构 ----
www.eeworm.com/read/275347/10822893

cpp minispantree_prim.cpp

//MiniSpanTree_Prim.cpp //This function is to create MiniSpanTree_Prim with Prim Algorithm # include # include # include # define INFINITY 1000 # define MAX_V
www.eeworm.com/read/462824/7195095

c djkstra.c

/* Program of shortest path between two node in graph using Djikstra algorithm */ #include #define MAX 10 #define TEMP 0 #define PERM 1 #define infinity 9999 struct node { int pr
www.eeworm.com/read/436397/7770565

cpp graph.cpp

#define UNVISITED 0 #define VISITED 1 #define INFINITY 9999999 #include #include #include "LList.h" #include class Edge//边 { public: int from,to,weight;
www.eeworm.com/read/196845/8054830

h jt.h

#ifndef JT_H #define JT_H #define False 0 #define True 1 #define INFINITY 10000 typedef struct { int number; float expenditure; int begintime[2]; int arrivetime[2]; } Vehide;
www.eeworm.com/read/142809/12916636

cpp minispantree_prim.cpp

//MiniSpanTree_Prim.cpp //This function is to create MiniSpanTree_Prim with Prim Algorithm # include # include # include # define INFINITY 1000 # define MAX_V