代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/355017/10302141
contrib readme.txt.contrib
Licensed Materials - Property of IBM
C87CDNA
(c) Copyright IBM Corporation 1996, 2006
All rights reserved.
IBM, Lotus, Lotus Notes, Notes, and Domino are trademarks or registered
trademarks of
www.eeworm.com/read/162201/10325879
txt code3[1].txt
二、 实验内容
假设以一个带权有向图表示某一区域的公交线路网，图中顶点代表一些区域中的重要场所，弧代表已有的公交线路，弧上的权表示该线路上的票价（或搭乘所需时间），试设计一个交通指南系统，指导前来咨询者以最低的票价或最少的时间从区域中的某一场所到达另一场所。
算法思想：下面是R、W、Floyd求每对顶点之间最短路径算法的C语言程序，程序中矩阵A用来进行n次迭代，矩阵P用来记录路径，P ...
www.eeworm.com/read/354310/10365361
cpp 有向图的邻接矩阵.cpp
#include
#include "stdlib.h"
#define MAXvex 10
#define M 20
typedef char vextype;
typedef int adjtype;
typedef struct {
vextype vexs[MAXvex];
adjtype arcs[MAXvex][MAXvex];
www.eeworm.com/read/354174/10380617
cpp minitree.cpp
#include
#include
#include
#define infinate 10000
typedef struct graph /* 图的结构*/
{int **matrix; /*结点关系矩阵*/
char *vertex; /*字符结点*/
int arcs,vernum; /*边的条数，结
www.eeworm.com/read/161587/10393644
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/161587/10393938
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/161587/10394472
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/161587/10394494
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/161587/10394550
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/161587/10395122
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