搜索资源列表
dfs
- 深度搜索算法用于一幅二值图像，指定开始点和目标点-deep first search method is used for binary image,with assigned start and end point
basicoperationformap
- 包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如DFS和BFS），最小生成树，从某个源点到蓁各顶点的最短路径等-Includes most of the basic graph algorithms, each algorithm is to adjacency matrix and adjacency list is given in two forms, algorithms, including the construction of map
DFS3
- 我自己用matlab写的深度优先算法，能够实现任意选择起色访问点进行访问的DFS算法-Matlab write my own use depth-first algorithm, to achieve any improvement in access point choose to visit the DFS algorithm
main
- Dijkstra and DFS. It finds all the shortest ways from one point to all others. Then it counts all the ways which is always coming to the destiny.
dfs
- 先深搜索算法，图论的基础算法，用于遍历图中各点，图用点边集表示，以文件方式读入-First deep-search algorithm, graph theory based algorithm for traversing the graph, Figure with a set of edges that point to papers read
cifs_dfs_ref
- Contains the CIFS DFS referral mounting routines used for handling traversal via DFS junction point- Contains the CIFS DFS referral mounting routines used for handling traversal via DFS junction point
a
- 深度遍历求图的关节点，手写C。抛砖引玉。 减治法。算法课作业。-DFS GRAPH A point
cifs_dfs_ref
- Contains the CIFS DFS referral mounting routines used for handling traversal via DFS junction point for Linux.
DFS
- 功能：遍历任意两点之间的所有路径。 设置好起点v和终点end，把它们之间的路径都遍历一次并保存在path中-Features: traverse all paths between any two points. Set a good starting point and end point v end, the path between them are traversed once and saved in the path
graph_dfs
- 图的深度优先遍历算法程序。代码已经将图的深度以及每一层的节点写固定了。可以自己进去修改。-the program is the dfs of tree.the point of the tree and the layer of it has been fix.you can change it as you want.
BFS_graph
- 这是数据结构中图的广度优先算法的实现。广度优先算法是按照每个节点的拥有的孩子数目来进行遍历的。而不像图的深度优先算法是按照深层次，然后如果不能继续进入更深一层，就往回遍历。-BFS program of tree have a large of difference of the DFS program of trees.The produre of it is with the method of the children of a point ,rather than the depth o
DFS BFS 图
- 深度优先遍历和广度优先遍历算法实现从定点开始的遍历序列。(Depth first traversal and breadth first traversal algorithm to achieve the starting point from the traversal sequence)