代码搜索：graph
找到约 10,000 项符合「graph」的源代码
代码结果 10,000
www.eeworm.com/read/325486/13201178
java graph.java
// Introduced in Chapter 15
/** A potentially weighted graph. */
public class Graph {
/**
* edges[i][j] is the weight of the edge from i to j, or 0 if
* there is no such edge.
*/
private
www.eeworm.com/read/240686/13205056
h graph.h
// Ported to Visual C++ 5.0 Professional
#ifndef GRAPH_CLASS
#define GRAPH_CLASS
#include
#include
#include "stack.h"
#include "pqueue.h"
#include "queue.h"
#inc
www.eeworm.com/read/138874/13206439
class graph.class
www.eeworm.com/read/138874/13206502
java graph.java
package shared;
import java.lang.*;
import java.io.*;
import java.util.*;
/** An instance G of the data type graph consists of a list V of nodes
* and a list E of edges (node and edge are it
www.eeworm.com/read/138830/13208903
c graph.c
www.eeworm.com/read/240500/13216318
dll graph.dll
www.eeworm.com/read/240259/13228675
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/240259/13228758
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/239763/13258207
class graph.class
www.eeworm.com/read/239763/13258220