代码搜索:Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/146126/12668697
cpp testlabelcomponents.cpp
// test graph::labelComponents
#include
#include "graph.h"
#include "adjacencyWDigraph.h"
#include "adjacencyDigraph.h"
#include "adjacencyWGraph.h"
#include "adjacencyGraph.h"
#in
www.eeworm.com/read/146126/12668887
cpp testbellmanford.cpp
// test graph::bellmanFord
#include
#include "graph.h"
#include "adjacencyWDigraph.h"
#include "adjacencyWGraph.h"
#include "linkedWDigraph.h"
#include "linkedWGraph.h"
using nam
www.eeworm.com/read/145968/12686510
cpp searchlib.cpp
#include "searchlib.h"
int VERTEXTYPE::operator < (const VERTEXTYPE & right)
{
return ((g+h)
www.eeworm.com/read/145968/12686512
h searchlib.h
#ifndef __SEARCHLIB_H__
#define __SEARCHLIB_H__
#define VERTEX_WIDTH 70
#define VERTEX_HEIGHT 70
#define MAX_VERTEX_NUM 4900
#define MAX_LINK_NUM 4
#define X_MARCH 10 // x轴每次增长的步长
#define RAN
www.eeworm.com/read/145817/12700781
java dfs.java
/* =============== Program Description =============== */
/* 程序名称: DFS.c */
/* 程序目的: 设计一个深度优先搜索法来搜索图形的程序。 */
/* Written By Kuo-Yu Huang. (WANT Studio.)
www.eeworm.com/read/145817/12700783
java bfs.java
/* =============== Program Description =============== */
/* 程序名称: BFS.c */
/* 程序目的: 设计一个广度优先搜索法来搜索图形的程序。 */
/* Written By Kuo-Yu Huang. (WANT Studio.)
www.eeworm.com/read/145649/12708238
cpp router.cpp
#include "stdio.h"
#include "conio.h"
#define MAXVEX 20 //最大顶点数
int n,e; //全局变量,分别表示顶点数和边数
//----------图的定义,使用邻接矩阵表示-------------------
struct vertex //顶点的结构
{
char name; //顶点名称
bo
www.eeworm.com/read/332926/12716889
c 7.24.c
7.24③ 试利用栈的基本操作编写,按深度优先搜索策略
遍历一个强连通图的非递归形式的算法。算法中不规定具
体的存储结构,而将图Graph看成是一种抽象的数据类型。
实现下列函数:
void Traverse(Graph dig, VertexType v0, void(*visit)(VertexType));
/* Travel the digraph 'dig' with D
www.eeworm.com/read/244888/12838606
c 8_3_1.c
/* ======================================== */
/* 程式实例: 8_3_1.c */
/* 图形的深度优先搜寻法 */
/* ======================================== */
#include
www.eeworm.com/read/244888/12838626
c 8_6.c
/* ======================================== */
/* 程式实例: 8_6.c */
/* 使用拓扑排序来找图回路 */
/* ======================================== */
#include
#def