代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/400154/11582085
h graph.h
//*********** Graph.h ************//
//图的基类
#define UNVISITED 0
#define VISITED 1
#define INFINITE 9999
//Edge类
class Edge {
public:
int weight; //weight是边的权
int from; //
www.eeworm.com/read/400154/11582089
h graph.h
//*********** Graph.h ************//
//图的基类
#define UNVISITED 0
#define VISITED 1
#define INFINITE 0xffffffff
//Edge类
class Edge {
public:
int weight; //weight是边的权
int from;
www.eeworm.com/read/400154/11582093
h graph.h
//*********** Graph.h ************//
//图的基类
#define UNVISITED 0
#define VISITED 1
//#define INFINITE 0xffffffff
//Edge类
class Edge {
public:
int weight; //weight是边的权
int from;
www.eeworm.com/read/400147/11582130
h graph.h
//*********** Graph.h ************//
//图的基类
#define UNVISITED 0
#define VISITED 1
//Edge类
class Edge {
public:
int weight; //weight是边的权
int from; //from是边的始点
int to;
www.eeworm.com/read/262114/11605436
java graph.java
package shortestpath;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Collec
www.eeworm.com/read/261765/11624920
c graph.c
#include
#include
int LocateVex(ALGraph G,VertexType u)
{ /* 初始条件：图G存在，u和G中顶点有相同特征 */
/* 操作结果：若G中存在顶点u，则返回该顶点在图中位置；否则返回-1 */
int i;
for(i=0;i
www.eeworm.com/read/261765/11624924
h graph.h
#include
#include
/* 函数结果状态代码 */
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define MAX_NAME 3
#define
www.eeworm.com/read/158330/11625491
c graph.c
www.eeworm.com/read/157936/11654678
cpp graph.cpp
#include "StdAfx.h"
#include "Graph.h"
//图的邻接矩阵表示,任意两个顶点最短路径算法
#include "assert.h"
#include "queue.h"
#include "Sqlist.h"
//#include "MinSpanTree.h"
extern CSqlist VerticesList; //顶点表
www.eeworm.com/read/157936/11654686
h graph.h
#pragma once
#define MaxNumEdges 38 //最大边数
const int MaxNumVertices=19; //最大顶点数
#define MAXINT 2000 //权值的最大值
#define VERTICES 19 //顶点总数
class CGraph
{
pu