代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/452050/7451693
cc 2991919_ac_5386ms_16212k.cc
#include
#include
using namespace std;
class Graph
{
private:
int n;
struct edge{int to,cap,back;};
vector adj;
public:
Graph(int n=2):n(n)
{
a
www.eeworm.com/read/450111/7490493
cpp progress.cpp
/*
* Extended Operating System Loader (XOSL)
* Copyright (c) 1999 by Geurt Vos
*
* This code is distributed under GNU General Public License (GPL)
*
* The full text of the license can be f
www.eeworm.com/read/450111/7490499
cpp label.cpp
/*
* Extended Operating System Loader (XOSL)
* Copyright (c) 1999 by Geurt Vos
*
* This code is distributed under GNU General Public License (GPL)
*
* The full text of the license can be f
www.eeworm.com/read/448997/7520481
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/448636/7528849
m grtheorytest.m
% Test program for GrTheory functions
% Author: Sergiy Iglin
% e-mail: siglin@yandex.ru
% personal page: http://iglin.exponenta.ru
clear all
% select test:
% ntest=1 - grBase
% ntest=2 - gr
www.eeworm.com/read/448535/7531397
m warshall.m
function Anew = warshall(A)
%
% Find the transitive closure of the graph represented by the adjacency
% matrix A
%
% function Anew = warshall(A)
%
% A = adjacency matrix of graph
%
% Anew =
www.eeworm.com/read/443875/7621311
cpp 2337_eulerrd.cpp
#include
#include
#include
#include
#include
#include
using namespace std;
#define min(a,b) ((a)
www.eeworm.com/read/443457/7632735
cpp 1035.cpp
#include
#include
int r,c,n;
char graph[12][12];
int hash[12][12];
void search(){
int a=0,b=n-1,step=1;
while((a>=0&&a=0&&b
www.eeworm.com/read/441668/7667271
cpp p284b.cpp
#include "iostream.h"
#include "assert.h"
const int NumVertices = 6; //图中最大顶点个数
const int MAXINT=32767;
class Graph { //图的类定义
private:
int n;
int Edge[NumVertice
www.eeworm.com/read/441668/7667296
cpp p284.cpp
#include "iostream.h"
#include "assert.h"
const int NumVertices = 6; //图中最大顶点个数
const int MAXINT=32767;
class Graph { //图的类定义
private:
int n;
int Edge[NumVertice