Search - Visual Graph

Search - Visual Graph - List

[Data structs] 图论算法库 C++ 语言实现 DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Date : 2025-12-28 Size : 10kb User : 罗鹏魁
[Data structs] ljb DL : 0: 用邻接表实现个图的存储，在VISUAL C++环境中实现-Realize using adjacency list of graph storage, in VISUAL C++ Environment
Date : 2025-12-28 Size : 1kb User : pallas
[Data structs] xiaoyuandaohangzixun DL : 0: 校园导游咨询 1．需求分析 1.1从武汉理工大学的平面图上选取10个有代表性的景点，抽象成一个带权无向图。以中顶点表示景点，边上的权值表示图两地之间的距离。 1.2本程序的目的是为用户提供景点信息及路径咨询服务。根据用户指定的景点输出景点信息，或根据用户指定的始点和终点输出相应最短路径。 1.3程序采用对话方式，先显示服务项目，由用户自己选择查询内容。-Campus tour guides Advisory 1. Demand Analysis 1.1 from Wuhan University of Technology on the plan selected 10 representative spots, abstract as a weighted undirected graph. Vertex said in spots, the edge of the weights that map the distance between the two places. 1.2 The procedures are designed to provide users with information and path attractions consulting services. According to user-specified output Attractions Attractions information, or according to user-specified starting point and the end of the output the corresponding shortest path. 1.3 procedures for the use of dialogue, to show services of their choice by the user query.
Date : 2025-12-28 Size : 102kb User : guangzhao_05
[Data structs] create_graphic DL : 0: 图的建立，有多种的图可以选择，也可以选择图的遍历方法，里面的图的存储结构是以顶点数组和邻接矩阵的方式存储的。-Map-building, there are several plans to choose, you can choose to graph traversal method, which the storage structure of the plan is based on vertex adjacency matrix of the array and stored the.
Date : 2025-12-28 Size : 2kb User : 韩寒
[Data structs] bianli DL : 0: 利用Visual C++ 关于图的遍历数据结构中的经典例题-Using Visual C++ on the graph traversal
Date : 2025-12-28 Size : 874kb User : 潘晓芳
[Data structs] tubianli DL : 0: 数据结构中课程设计，图的遍历，环境Visual C-Data structure in curriculum design, graph traversal, environmental Visual C++
Date : 2025-12-28 Size : 901kb User : 潘晓芳
[Data structs] tu DL : 0: 图的遍历，C语言visual 2010版运行-Graph traversal, C language, visual 2010 edition runs
Date : 2025-12-28 Size : 3.31mb User : 王孖丰
[Data structs] TREE DL : 0: 在visual C++环境中实现图的最小生成树的生成，并实现最小生成树的权重的计算-Heavy computing implemented in visual C++ environment, minimum spanning tree graph generation and achieve the minimum spanning tree right
Date : 2025-12-28 Size : 1.71mb User : 李噹噹
[Data structs] MyGraph DL : 0: Implement graph in visual c++
Date : 2025-12-28 Size : 4.94mb User : MasoudBN