代码搜索：Graph

找到约 10,000 项符合「Graph」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/325668/13191484

cpp minispantree.cpp

#include #include #define MAX_ARC_NUM 100 #define MAX_VEX_NUM 20 #define OK 1 #define ERROR 0 typedef struct { int tail; //边的起始顶点 int head; //边
·
www.eeworm.com/read/240182/13232372

c ak.c

/* generator of hard maxflow problems */ /* 01/09/94 - Stanford Computer Science Department */ /* Boris Cherkassky - cher@theory.stanford.edu, on.cher@zib-berlin.de */ /* Andrew V. Goldberg - goldb
·
www.eeworm.com/read/324448/13262737

txt ch11i.txt

Chapter 11 Graphs: Instructor's CD questions 1. Which is not the name for a standard graph traversal? *a) Preorder. b) Depth first. c) Breadth first. 2. Depth-first search is best implemente
·
www.eeworm.com/read/322363/13381278

c dsf.c

#include #include #define INFINITY 0 #define MAX_VEX 20 /*最大顶点个数 */ int visited[20]; /*访问标志数组 */ /*图的领结矩阵存储结构*/ typedef struct{ char *vexs; /*顶点向量*/ in
·
www.eeworm.com/read/315999/13532739

cpp algo7-3.cpp

// algo7-3.cpp 调用算法7.7和7.8 #include"c1.h" #include"func7-1.cpp" // 包括顶点信息类型的定义及对它的操作 #include"func7-4.cpp" // 弧(边)的相关信息类型的定义及对它的操作 typedef VertexType TElemType; // 定义树的元素类型为图的顶点类型 #include"
·
www.eeworm.com/read/313941/13578906

txt 图的邻接矩阵和遍历.txt

# include const int max=10; //定义顶点个数的最大值为10 class Graph {private: int v1[max]; //存放顶点值的一维数组 int e1[max][max]; //存放边信息的邻接矩阵 int vNum,eNum;
·
www.eeworm.com/read/312166/13616965

cpp dn转换.cpp

#include #include #include #include #include #include #include using namespace std; //边结点 typedef struct Node{ int verInde
·
www.eeworm.com/read/308670/13696437

msc makefile.msc

#-----------------------------------------------# # Makefile for dos systems # # using a Microsoft Visual C++ compiler # #-----------------------------------------------# CC=cl # # Flags # AL --
·
www.eeworm.com/read/307592/13719782

txt 用 '贪心法' 解 '单源最短路径.txt

源程序: //////////////////////////////////////////////////////////// // 程序员：HayMaN // 功能：用 '贪心法' 解 '单源最短路径' // 时间：18:58 2006-11-24 ////////////////////////////////////////////////////////////
·
www.eeworm.com/read/303905/13806569

cpp grfloydl.cpp

#include #include #include "book.h" #include "grlist.h" // Floyd's all-pairs shortest paths algorithm void Floyd(Graph* G) { int D[G->n()][G->n()]; // Store
·