代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/432445/8604842
txt 1076.txt
1076.安全网络 ver.3
Time Limit: 5000 MS Memory Limit: 65536 K
Total Submissions: 981 (129 users) Accepted: 220 (92 users)
[ My Solution ]
Description
现在有个一个内部局域网络，里面有N台机器。为了某种安
www.eeworm.com/read/432431/8605313
txt 1067.txt
1067.圣斗士黄金十二宫（三）射手宫的迷宫
Time Limit: 3000 MS Memory Limit: 65536 K
Total Submissions: 334 (43 users) Accepted: 87 (33 users)
[ My Solution ]
Description
通过天蝎宫的星矢一行人来到射手宫前。
www.eeworm.com/read/387762/8655140
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/387762/8655158
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/387762/8655166
cpp graphutil.cpp
// Functions for creating and printing graphs
#define LINELEN 80
void Gprint(Graph* G) {
int i, j;
cout
www.eeworm.com/read/387762/8655189
cpp grdfsm.cpp
#include
#include
#include "book.h"
#include "grmat.h"
void PreVisit(Graph* G, int v) {
cout
www.eeworm.com/read/387762/8655269
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/387762/8655272
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/387762/8655358
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/387762/8655427
cpp grdfsl.cpp
#include
#include
#include "book.h"
#include "grlist.h"
void PreVisit(Graph* G, int v) {
cout