搜索资源列表
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
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