代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/303905/13806527
makefile
# Standard UNIX
CFLAGS= -s -O -DUNIX
# Debugging
#CFLAGS= -g -DUNIX
CC= g++
# Imlicit pattern rule for making .o files from .cpp files
%.o: %.cpp
$(CC) -c $(CFLAGS) $(CPPFLAGS) -o $@ $<
#
www.eeworm.com/read/303905/13806542
cpp grbfsl.cpp
#include
#include
#include "book.h"
#include "grlist.h"
#include "aqueue.h"
void PreVisit(Graph* G, int v) {
cout
www.eeworm.com/read/303905/13806548
cpp graphutil.cpp
// Functions for creating and printing graphs
#define LINELEN 80
void Gprint(Graph* G) {
int i, j;
cout
www.eeworm.com/read/303905/13806563
cpp grdfsm.cpp
#include
#include
#include "book.h"
#include "grmat.h"
void PreVisit(Graph* G, int v) {
cout
www.eeworm.com/read/303905/13806595
cpp grtestl.cpp
#include
#include
#include "book.h"
#include "grlist.h"
// Simple program to test graph construction:
// Version for Adjancency List representation
main(int argc, c
www.eeworm.com/read/303905/13806596
cpp grtestm.cpp
#include
#include
#include "book.h"
#include "grmat.h"
// Simple program to test graph construction:
// Version for Adjancency Matrix representation
main(int argc,
www.eeworm.com/read/303905/13806630
cpp grbfsm.cpp
#include
#include
#include "book.h"
#include "grmat.h"
#include "aqueue.h"
void PreVisit(Graph* G, int v) {
cout
www.eeworm.com/read/303905/13806657
cpp grdfsl.cpp
#include
#include
#include "book.h"
#include "grlist.h"
void PreVisit(Graph* G, int v) {
cout
www.eeworm.com/read/303774/13809368
log cc_build_debug.log
----------------------------- graph.pjt - Debug -----------------------------
"c:\ti\c5400\cgtools\bin\cl500" -@"Debug.lkf"
Build Complete,
0 Errors, 0 Warnings, 0 Remarks.
www.eeworm.com/read/303324/13818366
cpp topology.cpp
#include
struct EdgeNode {
int adj;
EdgeNode *next;
}; //边表结点类型
struct VertexNode {
int vertex;
EdgeNode *firstedge;
int tag;
}; //顶点结点类型
struct AdjGraph {