搜索资源列表
用C实现的bfs源程序
- 图论算法中必学的内容之一,希望能给学习编程的学弟学妹们有所帮助-graph algorithm will learn one of the elements in hopes of giving the incoming young men and women to learn programming help
BFS_Demo
- Demo s algorithm BFS
BFS_CUDA
- 用CUDA实现BFS算法源码。CUDA是NV公司基于GPU的统一计算架构，BFS复杂度由CPU上的O(V+E)降为O(diameter)，直径diameter即图中root到leaf的最长距离。-This is the algorithm of BFS(breadth first search) on CUDA, and its time complexity is down to O(diameter) which diameter means the longest distance bet
bipartite_graph_maximum_matching
- 三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including 1.Hungarian with DFS 2.Hungarian with BFS 3.Hopcroft-Karp algorithm
Graph
- some source codes of good algorithms as DFS, BFS etc in graph theory.
puzzle-bfs
- This program solves the puzzle by profema of 8 DFS algorithm
BFS
- 迷宫问题 队列求解 界面还不完善 可以自己添加-Maze problem solving interface queue is not perfect you can add your own
BFS_Iterate
- BFS mapreduce 实现，计算社交网络中各节点到源节点的最长距离。-BFS mapreduce
diameter_basic_GraphChi
- 使用GraphChi计算图直径的估值。方法是Magnien 等人提出的 Double Sweep 算法，即两次BFS算法，一次向前一次向后。-Diameter valuation of a Graph using GraphChi framework. Using the method of Double Sweep that Magnien proposed, which is two bfs process.
OOT
- Notes For OOT (c,c++) programs and examples or them PPTS of different-2 topics like inheritanse ,class object ,encapsulation , array,String . there are some examples of BFS,DFS,Best FS and there implementation code-Notes For OOT (c,c++) pro
graph
- 数据结构-图的操作 1.图的建立 2.图的深搜 3.图的广搜 4.最短路-(1).print the graph. (2).print the sequence of vertex names getting Depth-First Search. (3). print the sequence of vertex names getting Breadth-First Search. Dfs Bfs dijkstra