搜索资源列表
KrusKal
- 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
GRAPH3
- 实现图的遍历，主要是实现对无向图中是否存在有值为k的路径的算法实现-The realization of graph traversal, mainly the realization of undirected graph whether there is a value of k path algorithm
SCCandBC
- 求强连通分支，和双连通分支，输入两个文件，分别记录有向图和无向图-For strongly connected branch, and dual-branch connectivity, enter the two documents were recorded to map and undirected graph
tu
- 图的深度优先遍历包括图的建立，分有向图和无向图-Graph depth-first traversal, including the establishment of plans, sub-directed graph and undirected graph
lujin
- 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of
C_Course_Design(Include_Report)
- 数据结构课程设计(C版) 包括 运动会积分系统 简单文档编辑 无向图的基本操作实现 哈夫曼树编码解码 染色N皇后算法 调试报告-Data structure course design (C version) including Games integral system document editing simple undirected graph the basic operation of the realization of Huffman tree cod
dfs_tree
- 标准c++ acm算法实现,DFS求无向图生成树的算法.copy 至vc6.0 可编译-algorithm about dfs
Tree
- 最小生成树问题，给定一个无向图，求最小生成树-Minimum spanning tree problem, given an undirected graph, and minimum spanning tree
wxtbl
- 利用邻接表存储无向图,并深度遍历和广度遍历图-Use adjacency list stored undirected graph, and the depth and breadth traversal graph traversal
Depth_graph
- 在分布式应用,和计算应用中,用图来描述数据无疑是非常多的广度遍历无向图,深度遍历无向图,-In distributed applications, and computing applications, with plans to describe the data are no doubt very many of the undirected graph traversal breadth, depth, undirected graph traversal,
router_calc
- 根据一个有权的无向图生成指定结点（路由器）的路由表设有结点N，N的路由表由若干个路由项组成，路由项是<目的结点，下一跳>的二元组，其中目的结点是以N结点为源结点，通过N结点可以直接到达（目的结点是N结点的邻居）或通过N结点的邻居可间接到达的结点，其中下一跳即N结点的某领居，通过该邻居可间接到达目的结点，且到达目的结点的路径为最小代价路径.-According to a right of the undirected graph to generate the specified no
Floyd
- 无向图求最短路的floyd算法通用matlab程序 -Undirected graph for the shortest path algorithm floyd General matlab program
MINTREE
- 无向图的最小生成树程序，还不错哦~供大家分享，有文字说明-Undirected graph of the minimum spanning tree procedure, but also good for your sharing ~ Oh, there are text
undirected_graph_connectivity
- 求无向图连通分支_dfs实现,很好用，希望和大家分享-For undirected graph connectivity _dfs branch to achieve
wuxiangtu3
- 无向图的深度优先搜索 无向图的深度优先搜索 无向图的深度优先搜索 -Undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph of the depth-first search
wuxiangtu4
- 无向图的宽度优先搜索 -Undirected graph in breadth-first search of undirected graph breadth-first search
4.1
- 采用图的邻接表作为图的存储结构，完成有向图和无向图的DFS和BFS操作-The use of maps as a chart table adjacent to the storage structure, the completion of directed graph and undirected graph operations of DFS and BFS
SY11
- 邻接表存储有向图，判断任意两结点间有无路径-Storage adjacent to the map table to determine the two arbitrary whether the path between nodes
xiaoyuan
- 设计一个校园导游程序，为来访客人提供各种信息查询服务。测试数据根据实际情况指定。提示：一般情况下，校园的道路是双向通行的，可设校园平面图是一个无向图。顶点和边均含有相关信息。-Procedure to design a campus tour guide for visitors to provide information services. Test data specified according to the actual situation. Tip: In general, the
GraphDFS
- 应用深度优先遍历法访问无向图，采用了递归调用法和栈两种方法实现，很好的对比实现了算法-Use the means of DFS to visit undiction graph