搜索资源列表
topologicalorder
- 本程序用VC++实现有向图，无向图，有向网，无向网的拓扑排序-This program with VC++ to achieve a directed graph, undirected graph, a directed network, the network topology without sorting
prime1
- 对于如下一个带权无向图，给出节点个数以及所有边权值，用Prim算法求最小生成树。-failed to translate
UnDirectGraph
- 本程序实现了《数据结构》课本中无向图的基本算法，包括图的构造、图的深度、广度优先遍历算法、用Prim、Kruskal算法构造最小生成树以及分别用Dijkstra、Floyd算法求源点到所有顶点、图中任意两点间的最短路径，并给出具体的路径 -This procedure achieved a " data structure" textbooks undirected graph the basic algorithm, including graphs, graph depth
612109301
- 要求采用邻接矩阵作为无向图的存储结构，邻接表作为有向图的存储结构，完成无向图和有向图的建立，并对建立好的图进行深度和广度优先遍历。具体实现要求： 1. 通过键盘输入图的顶点和边信息，分别构造一个无向图的邻接矩阵和一个有向图的邻接表。 2. 分别对建立好的两个图进行深度和广度优先遍历，输出相应的遍历序列。 3. 统计两个图的连通分量的个数。 -Require the use of adjacency matrix as the storage structure of an und
Minimum-spanning-tree
- Kruskal算法和Prim算法 任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通). 加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和. 最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm Any edge of only by G, is composed of all the vertices containing G tree called G of the spannin
ShowAllPath
- 用C#写的无向图中任意连通路径的搜索算法，可能行路径搜索-Written in C# to any connected graph path search algorithm, may line the path search. .
liantong
- 输入图，找出该图的所有连通支。图用“邻接矩阵”法表示。用两个数组来存储图：一个数组（一维）存储图中顶点集；另一个数组（二维）映象图中顶点间的关系集。且对于无向图而言，其邻接矩阵是对称的。-Input map, to find the map of all the connected extension. Chart with
nettransmition
- 基于层级网络和无向图网络的知识传递效率仿真程序。-Based on the level of networks and undirected graph knowledge transfer efficiency of the network simulation program.
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
ex2_biconnected_components
- 输入为一个无向图，实现双联通子图的查找，用eclipse实现-Enter for a undirected graph, double Unicom subgraph finding, using eclipse the achievement 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