登录
首页 » Visual C++ » bfs

bfs

于 2013-12-05 发布 文件大小:174KB
0 177
下载积分: 1 下载次数: 12

代码说明:

  这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Insert
    POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)
    2013-11-21 23:27:17下载
    积分:1
  • BTree
    排序二叉树(模板类),主要用于数据排序和查找。已在项目中使用(Sorted binary tree (template class), mainly used for data sorting and searching. Has been used in the project)
    2010-10-09 13:49:44下载
    积分:1
  • Eight-Digital
    说明:  八数码 对任意数字序列重新排序 高级散列函数 MFC基础编程(Eight Digital Reorder the sequence of any number Senior hash function MFC based programming)
    2011-04-11 16:31:59下载
    积分:1
  • Four-bracket-operator
    数据结构中,运用链表实现四则括号运算等,运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)
    2011-12-12 10:51:31下载
    积分:1
  • basika
    经典算法巴斯卡三角的简单实现,vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)
    2012-10-30 13:22:26下载
    积分:1
  • 123
    中科大数据结构全部上机实验的实验程序以及报告,内容包括多项式,图,栈,SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)
    2020-10-14 19:57:30下载
    积分:1
  • 3.4.6
    单链表中的数据元素含有三种字符(字母、数字、其他字符),算法实现构造三个循环链表,是每个循环链表中只含有同一类字符,且利用原表中的结点空间作为这三个表的结点空间。(Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle list contains only the same type of character, and make use of the primary node space in a table as a node of the three table space.)
    2014-04-15 13:11:37下载
    积分:1
  • fast_sort
    /*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边, *基准值为一组,这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high,即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
    2012-10-26 21:42:43下载
    积分:1
  • 48qqqq
    主要用栈和树求解骑士问题,用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
    2009-03-21 22:34:39下载
    积分:1
  • AOV-Sort-Algorithm
    使用C语言编写的AOV网的拓扑排序,内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
    2011-10-26 16:34:29下载
    积分:1
  • 696518资源总数
  • 105559会员总数
  • 1今日下载