代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/400154/11582086
h graphm.h
#include "Graph.h"
#define N 7 // 定义图的顶点数
// 图的相邻矩阵表示法
class Graphm:public Graph {
private:
int **matrix; //指向相邻矩阵的指针
public:
void Graphm::IniGraphm(Graphm *Graphm, int A[N][N]); //
www.eeworm.com/read/400154/11582094
h graphm.h
#include "Graph.h"
#define N 7 // 定义图的顶点数
// 图的相邻矩阵表示法
class Graphm:public Graph {
private:
int **matrix; //指向相邻矩阵的指针
public:
void Graphm::IniGraphm(Graphm *Graphm, int A[N][N]); //
www.eeworm.com/read/400147/11582132
h graphm.h
#include "Graph.h"
#define N 3 // 定义图的顶点数
// 图的相邻矩阵表示法
class Graphm:public Graph {
private:
int **matrix; //指向相邻矩阵的指针
public:
void Graphm::IniGraphm(Graphm *Graphm, int A[N][N]); //
www.eeworm.com/read/347945/11625077
m invpos.m
function varargout = sumabsk(varargin)
% INVPOS Returns model of 1./x
% Author Johan L鰂berg
% $Id: invpos.m,v 1.1 2007/12/17 12:16:41 joloef Exp $
switch class(varargin{1})
case 'doubl
www.eeworm.com/read/347754/11638029
txt readme.txt
1, use vc71 compiling build\vc71\t264.sln _or_
2, compiling win32\dshow\dshow.sln
3, if u use 1, then copy src\enconfig.txt to build\vc71\bin\,
perform the cmd.exe, type t264 enconfig.txt
4, i
www.eeworm.com/read/157453/11702700
cpp ldigraph.cpp
// test linked adjacency list directed graph class
#include
#include "ldigraph.h"
void main(void)
{
LinkedDigraph G(4);
cout
www.eeworm.com/read/157453/11702736
cpp awdgraph.cpp
// test adjacency matrix weighted digraphs
#include
#include "awdgraph.h"
void main(void)
{
AdjacencyWDigraph G(4,100);
cout
www.eeworm.com/read/157453/11703229
out kruskal.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
enter edge 9
The input graph is
Vertex 1 = 6
www.eeworm.com/read/157453/11703502
cpp awgraph.cpp
// test adjacency matrix weighted graphs
#include
#include "awgraph.h"
void main(void)
{
AdjacencyWGraph G(4,100);
cout
www.eeworm.com/read/157453/11703637
cpp lwdgraph.cpp
// test of linked adjacency list weighted digraph class
#include
#include "lwdgraph.h"
void main(void)
{
LinkedWDigraph G(4);
cout