代码搜索：BFS
找到约 794 项符合「BFS」的源代码
代码结果 794
www.eeworm.com/read/390464/8464519
bfs-
/*BFS算法的非递归函数*/
#include
#include
#include
#define infinity 30000
#define MAX 20
int visited[MAX]; //访问标记
int (*visitFunc)(int v); //访
www.eeworm.com/read/458281/7299671
for bfs.for
SUBROUTINE BFS(X,Y,FY,GX,N,IMOS,ICOVG,TL,IT)
DIMENSION X(N),Y(N),GX(N),H(20,20),DELX(20),DELG(20)
IF(IT.GT.0)GO TO 151
TL=0.0001
151 ITER=0
ICOVG=0
ER1=0.01
ER2=0.001
ET1=0.001
ET2=1
www.eeworm.com/read/306956/13734630
for bfs.for
SUBROUTINE BFS(X,Y,FY,GX,N,IMOS,ICOVG,TL,IT)
DIMENSION X(N),Y(N),GX(N),H(20,20),DELX(20),DELG(20)
IF(IT.GT.0)GO TO 151
TL=0.0001
151 ITER=0
ICOVG=0
ER1=0.01
ER2=0.001
ET1=0.001
ET2=1
www.eeworm.com/read/405817/11456382
cpp ping(普通bfs，优先队列bfs).cpp
//状态的hash[节点标号][路径数]＝最小花费
//凡是搜索，除了数据量小以外，其它的都需要状态的保存
#include
#include
#include
#include
using namespace std;
#define Min(x,y) ((x)
www.eeworm.com/read/390183/8480260
pm bfs.pm
package Graph::Traversal::BFS;
use strict;
use Graph::Traversal;
use base 'Graph::Traversal';
sub current {
my $self = shift;
$self->{ order }->[ 0 ];
}
sub see {
my $self
www.eeworm.com/read/386291/8757723
java bfs.java
// bfs.java
// demonstrates breadth-first search
// to run this program: C>java BFSApp
////////////////////////////////////////////////////////////////
class Queue
{
private final int SIZE
www.eeworm.com/read/429077/8819999
h bfs.h
// Breadth first search routing algorithm
// George F. Riley, Georgia Tech, Winter 2000
#ifndef __BFS_H__
#define __BFS_H__
#include "rnode.h"
// The prototype for the shortest path function
void BF
www.eeworm.com/read/429077/8820021
cc bfs.cc
// Implementation of Breadth First Search algorithm
// George Riley, Georgia Tech, Winter 2000
#include "bfs.h"
#include "routealgo.h"
#include "rnode.h"
#include "tnode.h"
#include "rbitmap.h"
#incl
www.eeworm.com/read/285689/8822679
c bfs.c
/*************************************************/
/* 图的广度优先遍历算法 */
/* 程序名bfs.c 函数名bfs()、bfstraverse() */
/*************************************************/
#incl
www.eeworm.com/read/375828/9348827
c bfs.c
#include
#include
#define SIZE 100
#define MAXyjj_queue 10 //队列的最大容量
struct node //图的顶点结构
{
int vertex; //顶点数据
struct node *nextnode;
}