代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/211148/15186118
h graph.h
/*===============================================================================
Graph.h
Copyright (c) 2006 David D. All Rights Reserved.
www.eeworm.com/read/211148/15186120
cpp graph.cpp
#include "Graph.h"
using namespace Mido::Utility;
#define INFINITY 0xFFFFFFFF
Graph::Graph() : _N(0), _size(0)
{
}
Graph::Graph(const dag_t& array)
{
_N = _size = array.size();
www.eeworm.com/read/211086/15187362
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/211086/15187368
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/211049/15187801
c _graph.c
/*******************************************************************************
+
+ LEDA 3.0
+
+
+ _graph.c
+
+
+ Copyright (c) 1992 by Max-Planck-Institut fuer Informatik
+ Im Stadtw
www.eeworm.com/read/210318/15201601
java graph.java
package src;
class Edge
{
public String[] autoName;
public int distant;
public int cost;
public int autoNum;
private final int MAX_EDGES = 100;
private final int MAX_AM = 99999;
publ
www.eeworm.com/read/210198/15204658
c graph.c
www.eeworm.com/read/209351/15223129
gif graph.gif
www.eeworm.com/read/209193/15226230
graph sample.graph
6
(0 5 .1)
(5 1 .5) (5 2 1.0) (1 2 .9) (3 4 .2) (4 2 .3) (5 3 .3)
(5 4 .8) (2 4 0.1) (3 2 .6)
(0 0 .05)
www.eeworm.com/read/209193/15226236
h graph.h
#include
#include
#include
#include
#define CUSTOMNEW
#include "2heap.h"
#include "list.h"
struct GraphArc {
int source;
int dest;
float weight;
void *d