Location:
Search - prim
Search list
Description: 图论算法库 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
Platform: |
Size: 10240 |
Author: 罗鹏魁 |
Hits:
Description: 我写的,画出最短路径,及最小生成树
Prim Dijistra算法+ GDI实现-I write to depict the shortest path, and the smallest Prim Dijistra Spanning Tree Algorithm to achieve GDI
Platform: |
Size: 1940480 |
Author: nick |
Hits:
Description: 数据结构作业代码。
最小生成树 Prim实现。
win32 Console界面。-operation code data structure. Prim achieve the minimum spanning tree. Win32 Console interface.
Platform: |
Size: 7168 |
Author: 张钊宁 |
Hits:
Description: 数据结构中的Prim算法
本人自己编的
望大家给与支持-data structure of Prim algorithm I hope his series of the support we give
Platform: |
Size: 132096 |
Author: 周娜娜 |
Hits:
Description: 一个用Prim算法求解图的最小生成树，图是通过矩阵来建立。-an algorithm using the minimum spanning tree, the plan is to build through the matrix.
Platform: |
Size: 1024 |
Author: 傅蓉蓉 |
Hits:
Description: 最大流量Prim 算法寻找最小生成树,用C语言实现,有完整的注释-maximum flow Prim finding minimum spanning tree algorithm, using C language, a complete Notes
Platform: |
Size: 1024 |
Author: DoDoggy |
Hits:
Description: 这是我用net写的一个prim算法计算最小生成树的程序，欢迎大家下载-with net write a prim minimum spanning tree algorithm for the calculation procedures, we are happy to download
Platform: |
Size: 95232 |
Author: king |
Hits:
Description: prim算法 是一个比较常见的求最小生成树的算法,它用贪婪准则来编写算法的!-prim algorithm is a more common for the minimum spanning tree algorithm, which used to prepare guidelines for the greedy algorithm!
Platform: |
Size: 1024 |
Author: louy |
Hits:
Description: JAVA基础doc1、面向对象的特征有哪些方面
1.抽象：
抽象就是忽略一个主题中与当前目标无关的那些方面，以便更充分地注意与当前目标有关的方面。抽象并不打算了解全部问题，而只是选择其中的一部分，暂时不用部分细节。抽象包括两个方面，一是过程抽象，二是数据抽象。
2.继承：
继承是一种联结类的层次模型，并且允许和鼓励类的重用，它提供了一种明确表述共性的方法。对象的一个新类可以从现有的类中派生，这个过程称为类继承。新类继承了原始类的特性，新类称为原始类的派生类（子类），而原始类称为新类的基类（父类）。派生类可以从它的基类那里继承方法和实例变量，并且类可以修改或增加新的方法使之更适合特殊的需要。
3.封装：
封装是把过程和数据包围起来，对数据的访问只能通过已定义的界面。面向对象计算始于这个基本概念，即现实世界可以被描绘成一系列完全自治、封装的对象，这些对象通过一个受保护的接口访问其他对象。
4. 多态性：
多态性是指允许不同类的对象对同一消息作出响应。多态性包括参数化多态性和包含多态性。多态性语言具有灵活、抽象、行为共享、代码共享的优势，很好的解决了应用程序函数同名问题。
-doc1 JAVA based, object-oriented features are what one. Abstract : abstract is to overlook a main theme has nothing to do with the current target those areas, to more fully with the current attention to the goal area. Abstract does not intend to understand all the issues, and choose only the part of some of the details do not have the time being. Abstract include two aspects : First, the process of abstraction, data abstraction. 2. Succession : Inheritance is a kind of link-level model, and to allow and encourage the reuse category. It provides a clear statement of the common methods. Targeting a new category can be from the existing category derivatives, a process known as class inheritance. Inherited a new category of the characteristics of the original type, the new category called prim
Platform: |
Size: 53248 |
Author: la |
Hits:
Description: 图论算法库 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 theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit
Platform: |
Size: 4096 |
Author: |
Hits:
Description: prim算法Huffman算法Dijkstra算法和实验报告-prim algorithm Huffman algorithm Dijkstra algorithm and experimental report
Platform: |
Size: 759808 |
Author: maxiaowei |
Hits:
Description: Prim算法完整实现代码
用Prim算法求无向图的最小生成树
-Prim algorithm to achieve a complete code with Prim algorithm try to map the minimum spanning tree
Platform: |
Size: 3072 |
Author: 359369593 |
Hits:
Description: 用C语言编写的 如果以无向网表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使这个交通网的总造价最小-Using C language if no express n to the network traffic between cities network construction planning, Vertex city, the edge of the right to express the cost of the line and try to design a program to make the transportation network total cost of the smallest
Platform: |
Size: 1024 |
Author: 张公子 |
Hits:
Description: 7_5普里姆最小生成树,vc.net版本
数据结构的作业
Platform: |
Size: 512000 |
Author: chenying |
Hits:
Description: 1.显示该图的邻接矩阵
2.输出最小生成树的所有边及权值和-1. Revealed that the graph adjacency matrix 2. Output minimum spanning tree of all the edge and the right values and
Platform: |
Size: 906240 |
Author: 陈良 |
Hits:
Description: prim算法是从连通网中的某一个顶点开始，以此作为生成树的初始状态，然后不断的将网中的其他顶点添加到生成树上，直到最后一个顶点添加到生成数上时得到最小生成树．-prim algorithm is network connectivity from a vertex to start, as a spanning tree of the initial state, and then continuing to network other vertex added to the spanning tree until the last vertex added to the generated number to be the smallest when Spanning Tree.
Platform: |
Size: 8192 |
Author: 陈冰晶 |
Hits:
Description: Prim算法的实现，内容详见说明
开发环境为VS2003
-Prim algorithm, content development environment for the detailed description VS2003
Platform: |
Size: 6144 |
Author: 保密 |
Hits:
Description: 关于图像分割的一个代码，最小生成树Prim算法，能够实现相应功能，拿出来与大家共享-Image Segmentation on a code, Prim minimum spanning tree algorithm, can achieve the corresponding functions, and show to share with you
Platform: |
Size: 1024 |
Author: 陈明敏 |
Hits:
Description: 最小生成树
一．问题描述
构造一无向连通网，用Prim算法或Kruskal算法实现最小生成树的算法
二．实验目的
1．掌握网的基本概念和连通网的存储结构
2．掌握最小生成树的算法实现
三．实验要求
1．确定边的相邻顶点和权植，建立无向连通网，实现最小生成树。
2．Prim算法思想：
设G=（V，E）是一个无向连通图，令T=（U，TE）是G的最小生成树。T的初始状态为U={v0}，TE={}，然后重复执行下述操作：在所有u，v的边中找一条代价最小的边（u，v）并入集合TE，同时v并入U，直至U=V为止。此时TE中必有n-1条边，T就是最小生成树。
Platform: |
Size: 1024 |
Author: jjf |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.
Platform: |
Size: 105472 |
Author: 陈阳 |
Hits:
«
1
2
3
4
56
7
8
9
10
...
33
»