代码搜索:BFS

找到约 794 项符合「BFS」的源代码

代码结果 794
www.eeworm.com/read/375040/9375359

cpp bfs.cpp

#include #include #include char pos[362881]; int step[362881]; int quene[362881]; int move[4][2] = {0,1,0,-1,1,0,-1,0}; int numtemp[8] = {40320,5040,720,120,24,6,
www.eeworm.com/read/375038/9375376

cpp bfs.cpp

#include #include char pos[2
www.eeworm.com/read/168218/9932776

dat bfs.dat

6 1 2 1 3 4 5 5 6 7 6 7 5
www.eeworm.com/read/168218/9932928

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/361402/10054542

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/358191/10194606

dat bfs.dat

6 1 2 1 3 4 5 5 6 7 6 7 5
www.eeworm.com/read/358191/10194686

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/161587/10394980

dat bfs.dat

6 1 2 1 3 4 5 5 6 7 6 7 5
www.eeworm.com/read/161587/10395265

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/351296/10661614

cpp bfs.cpp

//标准广度优先搜索程序: #include #include using namespace std; #define SX 10 //宽 #define SY 10 //长 int dx[4]={0,0,-1,1}; //四种移动方向对x和y坐标的影响 int dy[4]={-1,1,0,0}; char Block[SY