代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/358507/10186117
cpp hello.cpp
#include
#include
#define INFINITY 32767
#define MAX_VEX 20 //最大顶点个数
bool *visited; //访问标志数组
//图的邻接矩阵存储结构
typedef struct{
char *vexs; //顶点向量
int arcs[MAX_VEX
www.eeworm.com/read/358191/10194147
cpp kruskal.cpp
// test Kruskal's min cost spanning tree algorithm
#include
#include "lwg.h"
void main(void)
{
LinkedWGraph G(7);
EdgeNode t[7];
int n = 7;
int e, u, v,
www.eeworm.com/read/358191/10194231
out ldigraph.out
Edges = 0
The graph is
Vertex 1 = 4 3
Vertex 2 = 1 4
Vertex 3 =
Vertex 4 = 2
The graph after deleting is
Vertex 1 = 4 3
Vertex 2 = 1
Vertex 3 =
Vertex 4 = 2
Deletion
www.eeworm.com/read/358191/10194425
out lgraph.out
Edges = 0
The graph is
Vertex 1 = 4 2 3
Vertex 2 = 3 1 4
Vertex 3 = 2 1
Vertex 4 = 1 2
The graph after deleting is
Vertex 1 = 4 2 3
Vertex 2 = 3 1
Vertex 3 = 2 1
www.eeworm.com/read/358191/10194430
out bbtsp.out
enter number of edges of 7 vertex graph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
enter edge 8
Cost = 31
Optimal tour is
1 4 2 6 5 3 7
www.eeworm.com/read/358191/10194452
out short.out
enter number of edges of 5 vertex digraph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
enter edge 7
The input graph is
0 4 2 0 8
0 0 0 4 5
0 0 0 1 0
0 0
www.eeworm.com/read/358191/10194650
cpp abfs.cpp
// test adjacency matrix graph class
#include
#include "ag.h"
void main(void)
{
AdjacencyGraph G(7);
int reach[8];
int n = 7;
cout
www.eeworm.com/read/356204/10235133
cpp storage.cpp
/**********************************************************************
** Copyright (C) 2000-2002 Trolltech AS. All rights reserved.
**
** This file is part of the Qtopia Environment.
**
** This fil
www.eeworm.com/read/356204/10235147
cpp memory.cpp
/**********************************************************************
** Copyright (C) 2000-2002 Trolltech AS. All rights reserved.
**
** This file is part of the Qtopia Environment.
**
** This fil
www.eeworm.com/read/355017/10302132
txt readme.txt
Licensed Materials - Property of IBM
C99VCEN
(c) Copyright IBM Corporation 1996, 2007
All rights reserved.
IBM, Lotus, Lotus Notes, Notes, and Domino are trademarks or registered
trademarks o