代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/291479/8416071
cpp 第三题.cpp
//3．自己设计一个项目，排出AOE网络，并将数据输入计算机，用程序进行分析。
#include
#include
#define MAX 20
class Stack //队列类
{ public:
int stack[200];
int top;int ba
www.eeworm.com/read/191860/8419301
txt topsort.txt
//图类结构体定义与相关操作graph4.h
typedef struct
{char *data;
int *visited;
float **edge;
int max,size;
}Graph;
//初始化图
void SetGraph(Graph *G,int n)
{int i,j;
G->data=new char[n];
G->visited=new
www.eeworm.com/read/189354/8473978
cpp main.cpp
#include
#include
#include"Graph.h"
void main()
{
ifstream in("data.txt");
int m;
in>>m;
Graph g;
g.makegraph(in,m);
int max=0;
for(int i=0;i
www.eeworm.com/read/390183/8480217
readme
This directory contains the following Perl modules from CPAN:
Graph-0.84
See the .pod documentation for copyright and license terms.
www.eeworm.com/read/390183/8480246
pm matrix.pm
package Graph::Matrix;
# $SIG{__DIE__ } = sub { use Carp; confess };
# $SIG{__WARN__} = sub { use Carp; confess };
use strict;
sub new {
my ($class, $g) = @_;
my @V = $g->vertices;
www.eeworm.com/read/188621/8524967
java graphlayout.java
/*
* WebSPHINX web crawling toolkit
* Copyright (C) 1998,1999 Carnegie Mellon University
*
* This library is free software; you can redistribute it
* and/or modify it under the terms of the GNU
www.eeworm.com/read/289762/8528658
c ln16.c
#include "stdio.h"
#define n 6 /*图的顶点数*/
#define e 6 /*图的边数*/
typedef char vextype; /*顶点数据类型*/
typedef int adjtype; /*权值类型*/
typedef struct
{ vextype v
www.eeworm.com/read/289762/8528660
c ln13.c
#include "stdio.h"
#define n 6 /*图的顶点数*/
#define e 6 /*图的边数*/
typedef char vextype; /*顶点数据类型*/
typedef int adjtype; /*权值类型*/
typedef struct
{ vextype vex
www.eeworm.com/read/431812/8652867
cpp pku2890.cpp
#include
#include
#define maxn 1001
typedef struct Graph
{
int n;
int v[maxn];
}Graph;
Graph G[maxn];
int N, M;
char v[maxn];
int cnt;
void init()
{
int i;
www.eeworm.com/read/387762/8655197
cpp grfloydl.cpp
#include
#include
#include "book.h"
#include "grlist.h"
// Floyd's all-pairs shortest paths algorithm
void Floyd(Graph* G) {
int D[G->n()][G->n()]; // Store