代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/378417/9231796
cpp p267.cpp
#include "P265.cpp"
#include "iostream.h"
#include "assert.h"
const int MaxNumEdges=100;
template
Graph ::
Graph ( const int sz=DefaultSize
www.eeworm.com/read/378417/9231801
cpp p261.cpp
class Graph {
//对象: 由一个顶点的非空集合和一个边集合构成, 每条边由一个顶点对来表示。
public:
Graph ( );
//建立一个空的图。
void InsertVertex ( const Type & vertex );
//在图中插入一个顶点vertex, 该顶点没有入边。
void Insert
www.eeworm.com/read/378417/9231828
cpp p265.cpp
#define NULL 0
template class Graph; //图的前视类定义
template class Edge { //边的定义
public:
friend class Graph
www.eeworm.com/read/181160/9272224
cpp funcs.cpp
#include "funcs.h"
#include
#include
#include
#include "pmandel.h"
double drand48()
{
return ((double)rand() / (double)RAND_MAX);
}
// fraction is a part of
www.eeworm.com/read/377354/9279244
cpp p263.cpp
#include "p278.cpp"
#include "IOSTREAM.H"
#include "p43&47.cpp"
const int MaxNumEdges = 50; //最大边数
#ifndef SetMaxVertices
#define SetMaxVertices
const int MaxNumVertices=10;
www.eeworm.com/read/377354/9279258
cpp p267.cpp
#include "P265.cpp"
#include "iostream.h"
#include "assert.h"
const int MaxNumEdges=100;
template
Graph ::
Graph ( const int sz=DefaultSize
www.eeworm.com/read/377354/9279262
cpp p261.cpp
class Graph {
//对象: 由一个顶点的非空集合和一个边集合构成, 每条边由一个顶点对来表示。
public:
Graph ( );
//建立一个空的图。
void InsertVertex ( const Type & vertex );
//在图中插入一个顶点vertex, 该顶点没有入边。
void Insert
www.eeworm.com/read/377354/9279281
cpp p265.cpp
#define NULL 0
template class Graph; //图的前视类定义
template class Edge { //边的定义
public:
friend class Graph
www.eeworm.com/read/180375/9310678
cpp dfs.cpp
// DFS.cpp : Defines the entry point for the console application.
//
#include
#include
#define Vnum 20
typedef struct arcnode //边结构
{
int adjvex;
struct ar
www.eeworm.com/read/375828/9348823
c map.c
#include
#include
struct node //图的顶点结构
{
int vertex; //顶点数据
struct node *nextnode;
};
typedef struct node *graph;
struct node head[6];
/* --------