代码搜索：graph
找到约 10,000 项符合「graph」的源代码
代码结果 10,000
www.eeworm.com/read/191860/8419305
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/191860/8419317
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/290958/8448157
pbl graph.pbl
www.eeworm.com/read/189354/8473974
cpp graph.cpp
// Graph.cpp: implementation of the Graph class.
//
//////////////////////////////////////////////////////////////////////
#include "Graph.h"
#include"queue.h"
///////////////////////////////////
www.eeworm.com/read/189354/8473977
h graph.h
// Graph.h: interface for the Graph class.
//
//////////////////////////////////////////////////////////////////////
#include
#if !defined(AFX_GRAPH_H__98BF1AC2_D7CC_427B_8B1B_243E0DD0F
www.eeworm.com/read/390183/8480226
pod graph.pod
=pod
=head1 NAME
Graph - graph data structures and algorithms
=head1 SYNOPSIS
use Graph;
my $g0 = Graph->new; # A directed graph.
use Graph::Directed;
my $g1 = Graph::
www.eeworm.com/read/390183/8480233
pm graph.pm
package Graph;
use strict;
BEGIN {
if (0) { # SET THIS TO ZERO FOR TESTING AND RELEASES!
$SIG{__DIE__ } = \&__carp_confess;
$SIG{__WARN__} = \&__carp_confess;
}
sub __carp_con
www.eeworm.com/read/189239/8482878
m graph.m
% Program 6-5
% graph.m
%
% The function of drawing the graph of simulation result.
%
% Input argument
% filename : name of the file which simulation result was stored.
%
% Output argument
www.eeworm.com/read/390016/8489132
h graph.h
# ifndef Graph_h
# include
# include
# define MAXNUM 1000
# define MAXSIZE 100
template struct Edgenode //节点的定义
{
int head;
int tail;
Type cost;
www.eeworm.com/read/189063/8493173