Description: A stack-based sequential depth-first decoder that returns Maximum-Likelihood solutions to spherical LAST coded MIMO system-type problems Platform: |
Size: 21435 |
Author:xzl |
Hits:
Description: 对图的深度优先遍历 基于堆栈 非堆栈 两种实现-On the graph depth-first traversal of non-stack based on the stack of two to achieve Platform: |
Size: 1024 |
Author:杨平安 |
Hits:
Description: A stack-based sequential depth-first decoder that returns Maximum-Likelihood solutions to spherical LAST coded MIMO system-type problems Platform: |
Size: 21504 |
Author:xzl |
Hits:
Description: (1)自选存储结构，输入含n个顶点（用字符表示顶点名称）和e条边的图G；
(2)指定任意顶点x为初始顶点，对图G作DFS遍历，输出DFS（深度优先）顶点序列(提示:使用栈实现DFS)；
(3)指定任意顶点x为初始顶点，对图G作BFS（广度遍历），输出BFS顶点序列(提示:使用队列实现BFS)；
(5)输入顶点x，查找图G:若存在含x的顶点，则删除该结点及与之相关连的边，并作DFS遍历(执行操作3)；否则输出信息“不存在x”；
(6)判断图G是否是连通图，输出信息“YES”/“NO”；
(7)如果选用的存储结构是邻接矩阵，则用邻接矩阵的信息生成图G的邻接表-(1) on-demand storage structure, input containing n vertices (with characters in the name of that vertex) and e edges of the graph G
(2) specify arbitrary vertex x as the initial vertex of the graph G for the DFS traversal, output DFS (depth-first) vertex sequence (Hint: Use the stack to achieve DFS)
(3) specify arbitrary vertex x as the initial vertex of the graph G for the BFS (breadth traversal), the output sequence of BFS vertex (hint: the realization of the use of queue BFS)
(5) input vertex x, find graph G: If there is a vertex with x, then the deletion of the nodes and edges associated with them, and DFS traversal (3 steps) Otherwise output "does not exist x"
(6) to determine whether graph G is a connected graph, output "YES"/"NO"
(7) If I choose the storage structure is the adjacency matrix, the adjacency matrix of the information used to generate the adjacency list graph G Platform: |
Size: 3072 |
Author:涂舒 |
Hits:
Description: 以邻接矩阵的方式确定有向网，完成：
A．建立并显示出它的邻接链表；
B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）；
C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况；
D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adjacency list B. Non-recursive approach to depth-first traversal, display the results of traversal, (and to keep out of the situation into the show stack) C. Sort of the graph topology, showing topology sort results and shows changes over time into the degree of changes in the domain D. Given a vertex to all other vertices to determine the shortest path Platform: |
Size: 3072 |
Author:li |
Hits:
Description: 深度优先搜索算法DFS的实现，1.如果有可能，访问一个领接的未访问的节点，标记它，并把它放入栈中。 2 当不能执行规则 1 时，如果栈不为空，则从栈中弹出一个元素。 3 如果不能执行规则 1 和规则 2 时，则完成了遍历。-Depth-first search algorithm DFS implementation, 1. If possible, visit a collar then outstanding access node, mark it and put it into the stack. 2 can not be performed when the rule 1, if the stack is not empty, pop an element from the stack. 3 If you can not implement rules 1 and 2, then the complete traversal. Platform: |
Size: 1024 |
Author:陈源 |
Hits:
Description: 数据结构中二叉树、堆栈、队列以及深度优先与广度优先算法实现-Binary tree data structure, stack, queue and the depth first and breadth-first algorithm Platform: |
Size: 93184 |
Author:木暮团 |
Hits:
Description: 用C实现的迷宫求解算法。图形界面，求解过程参照了深度优先搜索，迷宫由随即矩阵生成，采用栈作为路径存储结构。-Achieved with the C maze algorithm. Graphical interface, the process of solving the light of the depth-first search, maze generated by the matrix immediately, using the stack as the path to the storage structure. Platform: |
Size: 45056 |
Author:john |
Hits:
Description: C++解数独的代码，使用了三种方法，依次对应解决不同难度的数独，并且最后采用由堆栈为基础数据结构的深度优先搜索法解数独，可以保证解决所有的可解数独。使用了STL的bitset，利用位操作节省内存。-C++ code alone the stops, using three methods, followed by the corresponding number of varying difficulty to solve alone, and Finally the data structure by a stack-based depth-first search method of the stops independence can be guaranteed to solve all the stops independence. Using the STL, bitset, using bit operations to save memory. Platform: |
Size: 368640 |
Author:wjn_nb |
Hits:
Description: 使用Javascript和Applet实现网页版的插入算法、归并算法、堆排序、快速排序、多项式加减（用链实现）、十进制转化为二进制（用队+栈实现）、开放地址法（线性探测）、一次探测法（平方探测）、二次探测法（双HASH）实现快速查找、利用二叉排序树进行排序与查找以及删除一个节点、实现宽度优先或深度优先排序算法、实现Kruskal算法或Prime算法-Insertion algorithm, merging algorithm, heap sort, quick sort, polynomial addition and subtraction (with the chain to achieve), decimal converted to binary (+ stack implementation with the team), open the address method (linear probing), a detection method (square detection ), Secondary detection method (two-HASH) quick search, use binary sort tree to sort and find and delete a node, to achieve breadth or depth-first sorting algorithm, algorithm or Prime Kruskal algorithm to achieve. Platform: |
Size: 148480 |
Author:Lynn |
Hits:
Description: 对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。
-For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stack, push, pop, take the top element, sub-stack is empty ) to achieve depth-first search graph traversal and breadth-first search traversal algorithm. Platform: |
Size: 376832 |
Author:沈辉 |
Hits:
Description: 用C实现的迷宫求解算法。图形界面，求解过程参照了深度优先搜索，迷宫由随即矩阵生成，采用栈作为路径存储结构-Implemented in C maze solving algorithm. Graphical interface, the solution process with reference to the depth-first search, then the matrix generated by the maze, using the stack as the storage structure of the path Platform: |
Size: 5267456 |
Author:杨萝卜 |
Hits:
Description: 利用深度优先来进行迷宫问题的解决，使用的主要数据结构是栈。-To carry out the maze using depth-first solution to the problem, use the main stack data structure is Platform: |
Size: 954368 |
Author:林瀚驰 |
Hits:
Description: 1.以邻接表作存储结构，编写深度优先、广度优先的算法。
2、以邻接表作存储结构，编写最小生成树的算法。
3、以邻接表作存储结构，编写最短路径的算法。
1.以邻接表作存储结构，使用非递归方式编写深度优先、广度优先的算法。
-Adjacency list storage structure, writing depth first, breadth-first algorithm.
2 adjacency list storage structure, the preparation of the minimum spanning tree algorithm.
3 to the adjacent table storage structure, the to write shortest path algorithm.
Adjacency list storage structure, written in non-recursive depth-first and breadth-first algorithm. A binary list storage structure, written preamble, inorder, postorder and level order traversal of a binary tree algorithm.
2 binary linked list storage structure, written to calculate the binary tree depth, the total number of all nodes, leaf nodes, the number of two-child node, the number of single-child node algorithm
Preorder, inorder, postorder and level order traversal of a binary tree algorithm non-recursive (stack or queue) Platform: |
Size: 773120 |
Author: |
Hits:
Description: An Fst state s DFS stack state.Performs depth-first visitation. Visitor class argument determines actions and contains any return data. ArcFilter determines arcs that are considered.
Platform: |
Size: 3072 |
Author:pzvengven |
Hits:
Description: 1.基于网络通信的走迷宫
2.算法为栈，深度优先搜索遍历
3.基于线程
4.多路径的寻找
5.死胡同的判别
6.基于GUI实现(1. the maze of maze based on network communication
2. algorithm is the stack, the depth first search traversal
3. based on threads
4. The search for themultipath
5. Discrimination of dead alley
6. based on GUI implementation) Platform: |
Size: 14982144 |
Author:清于乐 |
Hits:
Description: 本源码通过C# GDI+ 编写。提供三种生成迷宫的算法（深度优先法，递归分割法，随机PRIM法），提供基于广度优先算法的迷宫自动寻径算法。迷宫大小、单元格大小、线粗均可自定义。优化了算法，递归改为栈实现，能够生成任意大地图而不会引起原来的函数递归栈溢出问题。生成迷宫后，支持键盘按键进行手动走迷宫。(The source code is written by C# GDI+. Three algorithms of maze generation (depth first, recursion segmentation, random PRIM) are provided to provide a maze routing algorithm based on the breadth first algorithm. Maze size, cell size, line thickness can be customized. The algorithm is optimized and recursive to stack implementation. It can generate any large map without causing the recursive stack overflow problem of the original function. After creating the maze, support the keyboard button to manually walk the maze.) Platform: |
Size: 88064 |
Author:sp_jiangjunling |
Hits:
Search - depth first stack