文件名称:text
-
所属分类：
- 标签属性：
- 上传时间：2013-06-02
-
文件大小：3.78mb
-
已下载：1次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
给定N个顶点、E条边的图G，完成图的相关算法，具体要求如下：
1 完成图的创建方法，即从键盘或文件输入图的信息，建立图的邻接表或是邻接矩阵存储结构。
2 给出判定图的性质的算法，即能够判定图是否是有向图、无向图、有向无环图、连通图等。
3 根据输入的图的性质，实现以下算法（选择其中一两个）：
如果图是有向无环图，则先实现图的某种遍历算法，在此基础上实现图的拓扑排序算法。
如果图是连通图，则求出图的最大生成树（不是最小生成树，参考讲授的方法），即得到的生成树权值之和最大。
如果图是无向图，则以第一个顶点当做源点，求出单源最短路径。
-Given N vertices, E edges Figure G, complete graph related algorithms, specific requirements are as follows: a complete graph creation method, that is, from the keyboard or file input map information, to establish the adjacency table or the adjacency matrix storage structure. Figure 2 shows the determination of the nature of the algorithm, that is able to determine whether the graph is a directed graph, undirected graph, a directed acyclic graph, connectivity maps. 3 According to the nature of the input graph, to achieve the following algorithm (choose one or two): If the graph is a directed acyclic graph, the first plan is to achieve some kind of traversal algorithm, based on this map of topological sorting algorithm implementation. If the graph is a connected graph, then calculate the Maximum Spanning Tree (not a minimum spanning tree, the reference teaches a method), which obtained the right values and the maximum spanning tree. If the graph is undirected, places the f
1 完成图的创建方法，即从键盘或文件输入图的信息，建立图的邻接表或是邻接矩阵存储结构。
2 给出判定图的性质的算法，即能够判定图是否是有向图、无向图、有向无环图、连通图等。
3 根据输入的图的性质，实现以下算法（选择其中一两个）：
如果图是有向无环图，则先实现图的某种遍历算法，在此基础上实现图的拓扑排序算法。
如果图是连通图，则求出图的最大生成树（不是最小生成树，参考讲授的方法），即得到的生成树权值之和最大。
如果图是无向图，则以第一个顶点当做源点，求出单源最短路径。
-Given N vertices, E edges Figure G, complete graph related algorithms, specific requirements are as follows: a complete graph creation method, that is, from the keyboard or file input map information, to establish the adjacency table or the adjacency matrix storage structure. Figure 2 shows the determination of the nature of the algorithm, that is able to determine whether the graph is a directed graph, undirected graph, a directed acyclic graph, connectivity maps. 3 According to the nature of the input graph, to achieve the following algorithm (choose one or two): If the graph is a directed acyclic graph, the first plan is to achieve some kind of traversal algorithm, based on this map of topological sorting algorithm implementation. If the graph is a connected graph, then calculate the Maximum Spanning Tree (not a minimum spanning tree, the reference teaches a method), which obtained the right values and the maximum spanning tree. If the graph is undirected, places the f
(系统自动生成,下载前可以参看下载内容)
下载文件列表
text/
text/Debug/
text/Debug/text.exe
text/Debug/text.ilk
text/Debug/text.pdb
text/ipch/
text/ipch/text-e7a07229/
text/ipch/text-e7a07229/text-2fde9051.ipch
text/text/
text/text.sdf
text/text.sln
text/text.suo
text/text/Debug/
text/text/Debug/cl.command.1.tlog
text/text/Debug/CL.read.1.tlog
text/text/Debug/CL.write.1.tlog
text/text/Debug/link-cvtres.read.1.tlog
text/text/Debug/link-cvtres.write.1.tlog
text/text/Debug/link.5044-cvtres.read.1.tlog
text/text/Debug/link.5044-cvtres.write.1.tlog
text/text/Debug/link.5044.read.1.tlog
text/text/Debug/link.5044.write.1.tlog
text/text/Debug/link.5220-cvtres.read.1.tlog
text/text/Debug/link.5220-cvtres.write.1.tlog
text/text/Debug/link.5220.read.1.tlog
text/text/Debug/link.5220.write.1.tlog
text/text/Debug/link.7952-cvtres.read.1.tlog
text/text/Debug/link.7952-cvtres.write.1.tlog
text/text/Debug/link.7952.read.1.tlog
text/text/Debug/link.7952.write.1.tlog
text/text/Debug/link.8868-cvtres.read.1.tlog
text/text/Debug/link.8868-cvtres.write.1.tlog
text/text/Debug/link.8868.read.1.tlog
text/text/Debug/link.8868.write.1.tlog
text/text/Debug/link.command.1.tlog
text/text/Debug/link.read.1.tlog
text/text/Debug/link.write.1.tlog
text/text/Debug/mt.command.1.tlog
text/text/Debug/mt.read.1.tlog
text/text/Debug/mt.write.1.tlog
text/text/Debug/rc.command.1.tlog
text/text/Debug/rc.read.1.tlog
text/text/Debug/rc.write.1.tlog
text/text/Debug/stdafx.obj
text/text/Debug/text.exe.embed.manifest
text/text/Debug/text.exe.embed.manifest.res
text/text/Debug/text.exe.intermediate.manifest
text/text/Debug/text.lastbuildstate
text/text/Debug/text.log
text/text/Debug/text.obj
text/text/Debug/text.pch
text/text/Debug/text.vcxprojResolveAssemblyReference.cache
text/text/Debug/text.write.1.tlog
text/text/Debug/text_manifest.rc
text/text/Debug/vc100.idb
text/text/Debug/vc100.pdb
text/text/ReadMe.txt
text/text/stdafx.cpp
text/text/stdafx.h
text/text/targetver.h
text/text/text.cpp
text/text/text.vcxproj
text/text/text.vcxproj.filters
text/text/text.vcxproj.user
text/Debug/
text/Debug/text.exe
text/Debug/text.ilk
text/Debug/text.pdb
text/ipch/
text/ipch/text-e7a07229/
text/ipch/text-e7a07229/text-2fde9051.ipch
text/text/
text/text.sdf
text/text.sln
text/text.suo
text/text/Debug/
text/text/Debug/cl.command.1.tlog
text/text/Debug/CL.read.1.tlog
text/text/Debug/CL.write.1.tlog
text/text/Debug/link-cvtres.read.1.tlog
text/text/Debug/link-cvtres.write.1.tlog
text/text/Debug/link.5044-cvtres.read.1.tlog
text/text/Debug/link.5044-cvtres.write.1.tlog
text/text/Debug/link.5044.read.1.tlog
text/text/Debug/link.5044.write.1.tlog
text/text/Debug/link.5220-cvtres.read.1.tlog
text/text/Debug/link.5220-cvtres.write.1.tlog
text/text/Debug/link.5220.read.1.tlog
text/text/Debug/link.5220.write.1.tlog
text/text/Debug/link.7952-cvtres.read.1.tlog
text/text/Debug/link.7952-cvtres.write.1.tlog
text/text/Debug/link.7952.read.1.tlog
text/text/Debug/link.7952.write.1.tlog
text/text/Debug/link.8868-cvtres.read.1.tlog
text/text/Debug/link.8868-cvtres.write.1.tlog
text/text/Debug/link.8868.read.1.tlog
text/text/Debug/link.8868.write.1.tlog
text/text/Debug/link.command.1.tlog
text/text/Debug/link.read.1.tlog
text/text/Debug/link.write.1.tlog
text/text/Debug/mt.command.1.tlog
text/text/Debug/mt.read.1.tlog
text/text/Debug/mt.write.1.tlog
text/text/Debug/rc.command.1.tlog
text/text/Debug/rc.read.1.tlog
text/text/Debug/rc.write.1.tlog
text/text/Debug/stdafx.obj
text/text/Debug/text.exe.embed.manifest
text/text/Debug/text.exe.embed.manifest.res
text/text/Debug/text.exe.intermediate.manifest
text/text/Debug/text.lastbuildstate
text/text/Debug/text.log
text/text/Debug/text.obj
text/text/Debug/text.pch
text/text/Debug/text.vcxprojResolveAssemblyReference.cache
text/text/Debug/text.write.1.tlog
text/text/Debug/text_manifest.rc
text/text/Debug/vc100.idb
text/text/Debug/vc100.pdb
text/text/ReadMe.txt
text/text/stdafx.cpp
text/text/stdafx.h
text/text/targetver.h
text/text/text.cpp
text/text/text.vcxproj
text/text/text.vcxproj.filters
text/text/text.vcxproj.user
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.