Location:
Search - graph.h
Search list
Description: 作者将一个CGraph类由像素模式下，扩展到逻辑模式下，并加了x,y轴的箭头，可以添加曲线名称。使用的方法:
复制Graph.h,Graph.cpp GraphLegend.cpp.GraphLegend.h GraphSeries.cpp,GraphSeries.h六个文件到相应的目录下，然后把他们加入到工程中，修改相应的头文件。在示例工程中作者提供了绘制饼图和直方图的代码。-CGraph author of a category by the pixel mode, the logical extension of the model, plus the x, y axis of the arrow, curve names can be added. The methods used : copy Graph.h, Graph.cpp GraphLegend.cpp.GraphLegend.h GraphSeries.cpp, GraphSeries.h six documents to the corresponding directory, and then put them into the project, the first to amend the corresponding document. Examples of projects in which the author provides a mapping pie and histogram of the code.
Platform: |
Size: 29616 |
Author: 张敏 |
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 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: 10202 |
Author: 罗鹏魁 |
Hits:
Description: 根据不同的数据集画出相应的柱状图
包括的主要文件有
Graph.dsw
GraphView.cpp
GraphView.h
Graph.h
Platform: |
Size: 50855 |
Author: 白伊清 |
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: 4275 |
Author: kelly |
Hits:
Description: 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。
该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。
Platform: |
Size: 10025 |
Author: lllstar |
Hits:
Description: 作者将一个CGraph类由像素模式下，扩展到逻辑模式下，并加了x,y轴的箭头，可以添加曲线名称。使用的方法:
复制Graph.h,Graph.cpp GraphLegend.cpp.GraphLegend.h GraphSeries.cpp,GraphSeries.h六个文件到相应的目录下，然后把他们加入到工程中，修改相应的头文件。在示例工程中作者提供了绘制饼图和直方图的代码。-CGraph author of a category by the pixel mode, the logical extension of the model, plus the x, y axis of the arrow, curve names can be added. The methods used : copy Graph.h, Graph.cpp GraphLegend.cpp.GraphLegend.h GraphSeries.cpp, GraphSeries.h six documents to the corresponding directory, and then put them into the project, the first to amend the corresponding document. Examples of projects in which the author provides a mapping pie and histogram of the code.
Platform: |
Size: 29696 |
Author: 张敏 |
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 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: #include "stdio.h"
#include "malloc.h"
#define TRUE 1
#define n 39
#define max 500
typedef struct
{
char p[n]
float w[n][n]
}graph
graph *ga2
int visit[n]
int path[n][n]
float C[n][n]
float A[n][n] -#include "stdio.h"#include "malloc.h"#define TRUE 1#define n 39#define max 500 typedef struct { char p[n] float w[n][n] }graph graph*ga2 int visit[n] int path[n][n] float C[n][n] float A[n][n]
Platform: |
Size: 45056 |
Author: jiangshan |
Hits:
Description: 根据不同的数据集画出相应的柱状图
包括的主要文件有
Graph.dsw
GraphView.cpp
GraphView.h
Graph.h-According to different data sets to draw the corresponding histogram for all the major documents Graph.dswGraphView.cppGraphView.hGraph.h
Platform: |
Size: 50176 |
Author: 白伊清 |
Hits:
Description: 图论：图的M着色问题
GraphM.h
GraphOpr.h
mColor.cpp
mColor.dsp
mColor.dsw
mColor.h
mColor.ncb
mColor.opt
mColor.plg
test
test.gph-graph theory : Figure M Coloring GraphM.h GraphOpr.h mColor.cpp mColo r.dsp mColor.dsw mColor.h mColor.ncb mColor. opt mColor.plg test test.gph
Platform: |
Size: 12288 |
Author: silwol |
Hits:
Description: Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.
Platform: |
Size: 3072 |
Author: 卢松 |
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: GC_optimization - software for energy minimization with graph cuts Version 2.0 http://www.csd.uwo.ca/faculty/olga/software.html-GC_optimization-software for energy min imization with graph cuts Version 2.0 http :// www.csd.uwo.ca/faculty/olga/software.h Page 13 13
Platform: |
Size: 44032 |
Author: Chen |
Hits:
Description: GraphFX - A graph framework.（bar型图表的显示）
CGraphFX frameworks, include GraphFX.h, GraphFX.cpp, Screen.h, Screen.cpp, ItemArray.h, ItemArray.cpp, Item.h and Item.cpp to your project.
-GraphFX- A graph framework. (Bar chart display type) CGraphFX frameworks, include GraphFX.h, GraphFX.cpp, Screen.h, Screen.cpp, ItemArray.h, ItemArray.cpp, Item.h and Item.cpp to your project.
Platform: |
Size: 196608 |
Author: wang an |
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 Theory Algorithm Library C++ Language code realize the contents of graph theory algorithm library, which includes the following algorithms: single-source shortest path Dijkstra algorithm for single-source shortest path Bellman-Ford algorithm Prim minimum spanning tree algorithm between each pair of nodes Flod-Warshall shortest path algorithm Language C++ compiler platform VisualAge C++ 4.0 Author starfish (starfish.h @ china.com) Remarks procedures used C++ language in VisualAge C++ 4.0 debugging through.
Platform: |
Size: 1024 |
Author: 王兵 |
Hits:
Description: 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。
该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。
-err
Platform: |
Size: 10240 |
Author: lllstar |
Hits:
Description: graph cut for itk. It uses a-expansion. Must install itk first and run with itk.
Platform: |
Size: 969728 |
Author: yaoyao zhu |
Hits:
Description: 可对音频输入、音频文件、位图文件进行频谱分析，显示频谱图
-Of audio input, audio files, bitmap files spectrum analysis shows that the spectrum graph
Platform: |
Size: 51200 |
Author: chobits |
Hits:
Description: 一个在TurboC下的简单五子棋,调用Graph.h，能够人机对战。并且保留上最近一次游戏的棋谱的棋谱-a simple Gobang game devlop under TurboC
Platform: |
Size: 30720 |
Author: xusheng |
Hits:
Description: Dos下的用画图系统，用graph.h编写。能编译成功但是在AMD内核的环境下有可能运行不了。-Drawing system used under Dos with graph.h prepared. However, AMD can successfully compile the kernel may not run under.
Platform: |
Size: 3072 |
Author: Xyang |
Hits: