代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/214343/15105107
java graph.java
// The interface for Graphs.
// (c) 1998, 2001 duane a. bailey
package structure;
import java.util.Iterator;
/**
* The interface describing all Graph objects. Graphs are collections
* of vertices
www.eeworm.com/read/113972/15119468
h graph.h
/*
=============0x13h display mode version 1.1
=============CopyRight (C) LiGungcun
=============QQ:66855618
=============E-Mail: hoya-lee@sohu.com
*/
#ifndef _V13
#define _V13
/*===========he
www.eeworm.com/read/213785/15124802
tpu graph.tpu
www.eeworm.com/read/212904/15145762
class graph.class
www.eeworm.com/read/212904/15145795
java graph.java
package toocom.ocgl;
import java.util.*;
import javax.swing.*;
import java.awt.*;
import java.awt.geom.*;
import java.awt.font.*;
/**
* This class represents the conceptual graphs of the o
www.eeworm.com/read/212829/15148040
cpp graph.cpp
//图的相关运算的实现graph.cpp
#include"graph.h"
//构造函数,初始化图的邻接矩阵
AdjMatrix::AdjMatrix(int n,int k2)
{int i,j;
if(k2==0){//初始化无(有)向无权图
for(i=0;i
www.eeworm.com/read/212829/15148046
h graph.h
//图的相关数据类型的定义graph.h
//最多顶点数
const int MaxV=10;
//最大权值
const int MaxValue=99;
//定义邻接表中的边结点类型
struct edgenode {
int adjvex; //邻接点域
int weight; //权值域
edgenode* next;//指向下一个边结点的链域
};
//
www.eeworm.com/read/212348/15159135
c graph.c
www.eeworm.com/read/212245/15161393
lib graph.lib
www.eeworm.com/read/212245/15161438