代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/211952/15169676
pas p1516.pas
{$I-,Q-,R-,S-}
PROGRAM p1516;
CONST
maxn = 100;
TYPE
Tnum = array[0..maxn , 0..maxn ]of Integer;
Tgraph = array[1..maxn , 1..maxn ]of Boolean;
TLink
www.eeworm.com/read/211952/15169681
cpp p1589.cpp
// p1589.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
#include
#include
using namespace std
www.eeworm.com/read/211952/15169687
cpp p1525.cpp
// p1525.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
int N , M , Ans;
bool graph [130] [130] , Mark [130];
int L
www.eeworm.com/read/211952/15169704
cpp p2134_搜索.cpp
#include
#define MAXN 22
int N , graph [MAXN] [MAXN] , Add [MAXN] , LeaveSum , Max;
void init ();
void Search ( int , int );
main ()
{
int total;
www.eeworm.com/read/211952/15169990
cpp p1435.cpp
// zju 1435
#include
#include
#include
const int dx [16] = { 0 , 0 , -1 , 1 , -1 , 1 , -1 , 1 , -1 , -1 , 1 , 1 , -2 , -2 , 2 , 2 };
const int dy [16]
www.eeworm.com/read/211952/15170118
cpp p1882_二分匹配.cpp
// p1882.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
int N , M;
bool graph [100] [100];
double X [200] , Y [200]
www.eeworm.com/read/211952/15170273
cpp p1221.cpp
#include
#include
const int n = 20;
int graph [20] [20];
int Long [20] [20];
bool init ()
{
int i , j;
int total , b;
www.eeworm.com/read/211648/15176130
c traverse.c
/*图的遍历的演示（c 语言 数据结构课程设计题）*/
#define M 20
#include
#include
#include
/*定义图*/
typedef struct{
int V[M];
int R[M][M];
int vexnum;
}Graph;
/*
www.eeworm.com/read/208856/15234222
cpp algo0704.cpp
void DFSTraverse(Graph G, Status (*Visit)(int v)) { // 算法7.4
// 对图G作深度优先遍历。
int v;
VisitFunc = Visit; // 使用全局变量VisitFunc，使DFS不必设函数指针参数
for (v=0; v
www.eeworm.com/read/207427/15271936
h mazeanaly.h
#include "head.h"
int crossNum(int graph[CONST_MAZEX][CONST_MAZEY],int,int);
int mazeAnaly(int graph[CONST_MAZEX][CONST_MAZEY],int,int,int,int,int,int &);
int crossNum(int graph[CONST_MAZEX][CO