代码搜索：graph
找到约 10,000 项符合「graph」的源代码
代码结果 10,000
www.eeworm.com/read/331864/12803507
cpp graph.cpp
//图的运算的实现文件graph3.cpp
#include"graph3.h"
//构造函数,初始化图的邻接矩阵与边集数组
adjMList::adjMList(RCW GE[],int n,int e)
{int i,j;
for(i=0; i
www.eeworm.com/read/331864/12803509
h graph.h
//利用克鲁斯卡尔方法求边集数组所示图的最小生成树
//图的相关数据类型的定义graph3.h
//最多顶点数
const int MaxV=10;
//最大权值
const int MaxValue=99;
//定义邻接表中的边结点类型
struct edgenode {
int adjvex; //邻接点域
int weight; //权值域
e
www.eeworm.com/read/331812/12805861
java graph.java
/* Graph class */
import java.awt.*;
import java.io.*;
import java.net.*;
import java.util.*;
public class Graph {
Node nodes[];
Edge edges[];
Arrow arrows[];
int n_nodes, n_edges, n_arrows,
www.eeworm.com/read/331812/12805905
class graph.class
www.eeworm.com/read/331812/12805914
circle graph.circle
8 16 1
1 50 200
2 200 50
3 350 50
4 500 200
5 500 350
6 350 500
7 200 500
8 50 350
1 2 10
2 1 5
2 3 9
3 2 5
3 4 8
4 3 4
4 5 7
5 4 14
5 6 6
6 5 12
6 7 5
7 6 10
7 8 4
8 7 8
8 1 3
1 8 6
www.eeworm.com/read/331812/12805951
java graph.java
/* Graph class */
import java.awt.*;
import java.io.*;
import java.net.*;
import java.util.*;
public class Graph {
Node nodes[];
Edge edges[];
Arrow arrows[];
int n_nodes, n_edges, n_arrows,
www.eeworm.com/read/331812/12806044
class graph.class
www.eeworm.com/read/331812/12806058
circle graph.circle
8 16 1
1 50 200
2 200 50
3 350 50
4 500 200
5 500 350
6 350 500
7 200 500
8 50 350
1 2 10
2 1 5
2 3 9
3 2 5
3 4 8
4 3 4
4 5 7
5 4 14
5 6 6
6 5 12
6 7 5
7 6 10
7 8 4
8 7 8
8 1 3
1 8 6
www.eeworm.com/read/331812/12806120
java graph.java
/* Graph class */
import java.awt.*;
import java.io.*;
import java.net.*;
import java.util.*;
public class Graph {
Node nodes[];
Edge edges[];
Arrow arrows[];
int n_nodes, n_edges, n_arrows,
www.eeworm.com/read/331812/12806628
java graph.java
/* Graph class */
import java.awt.*;
import java.io.*;
import java.net.*;
import java.util.*;
import java.lang.*;
public class Graph {
Node nodes[];
Edge edges[];
Arrow arrows[];
Vector v_nodes