代码搜索：BFS
找到约 794 项符合「BFS」的源代码
代码结果 794
www.eeworm.com/read/156891/11756467
dsp bfs.dsp
# Microsoft Developer Studio Project File - Name="bfs" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Conso
www.eeworm.com/read/156891/11756468
dsw bfs.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/256636/11982475
cpp bfs.cpp
#include "stdafx.h"
#include "bfs.h"
extern HASH tree;
CString BFS::getIntroduction(){
CString intro = "广度优先搜索\r\n\r\n"
"能保证找到最优解，搜索方式为逐层搜索。";
return intro;
}
int BFS::searc
www.eeworm.com/read/256636/11982479
h bfs.h
#include "searcher.h"
#ifndef _BFS_H_
#define _BFS_H_
class BFS: public searcher{
public:
virtual CString getIntroduction();
virtual int search(int begin, int end, int &stop, int val = 0)
www.eeworm.com/read/132141/14107983
out bfs.out
enter number of edges in graph
enter edge 1
enter edge 2
enter edge 3
enter edge 4
enter edge 5
enter edge 6
Doing bfs from vertex 1 labeling 1
Doing bfs from vertex 4 labeling 2
Doing bfs fr
www.eeworm.com/read/125979/14453191
cpp bfs.cpp
#include
const int nmax=100;
typedef struct
{
int data[nmax+1];
int adjmat[nmax+1][nmax+1];
int n,e;
}mat_graph;
typedef struct
{
int data[n
www.eeworm.com/read/222696/14679813
c bfs.c
www.eeworm.com/read/122383/14695997
cpp bfs.cpp
/******Don't forget to download*****
*****GRAPHICAL DATA FILE STRUCTURE*****
*****A approach to learn DFS Graphically*****
Only @ http://www.vivekpatel.cjb.net */
//Breadth First Search
www.eeworm.com/read/122383/14696015
bak bfs.bak
//Breadth First Search Traversal (BFS)
#include
#include
#define MAX_NODE 50
struct node{
int vertex;
node *next;
};
node *adj[MAX_NODE]; //For storing Adjacency