搜索资源列表
Graph
- 程序采用C++编写，在C++Builder6.0中编译通过，用于计算简单图结构的连通度和结合度。-Using C++ program written in C++ Builder6.0 in compiles, used to calculate the simple graph structure, degree of connectivity and integration.
Insight_Journal_306_1
- graph cut source code and reference paper
GraphPrj
- 针对大规模稀疏无向图开发的聚类算法。附带测试页面-this program is supposed to embark on the undiret graph clustering issue.
weimianfenge
- 一种改进的图象分割程序,分割出来效果相当好,尤其对于丰富的图象,保证别人没有上传过-Based on graph cut image segmentation algorithm, split the result was very good, especially for texture-rich images, ensure that no one else uploaded
phpgraphlib_v2.21
- PHPGraphLib is a PHP 4.3+ friendly object-oriented class that has powerful customization features, allowing you to generate the perfect bar, line, or pie graph for any application. Best used with dynamic data, PHPGraphLib allows easy visual interpret
GraphPackage
- this a delphi VCL with source code to draw and use 2D,3D graph -this is a delphi VCL with source code to draw and use 2D,3D graph
graph
- 实现各种图的网络结构的实现方法，是学习传感器网络的很好的软件-Network structure to achieve a variety of graph realization method is good to learn a software sensor networks
graph.cpp
- The graph network in c language
graph
- Graph viewer, you can have graph here
bipartite_graph_maximum_matching
- 三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including 1.Hungarian with DFS 2.Hungarian with BFS 3.Hopcroft-Karp algorithm
Bipartite-graph-to-determine
- 本压缩文件完整地实现了二分图判定的判定算法，代码很完整 -This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
Primukas.java.tar
- In computer science, Prim s algorithm is an algorithm that finds a minimum spanning tree for a connected weighted undirected graph.
acmmoban
- acm 模板，数论，图论，各种模板，最大字段和，N皇后模板，欧拉函数-acm templates, number theory, graph theory, a variety of templates, the largest field and, N Queen template, the Euler function
6139772-Graph-Implementation-Using-Linked-List.ra
- this is a source code for graph implementation
Coloring_a_graph_using_split_decomposition
- A solution for Graph Coloring problem Coloring a graph using split decomposition
graph
- prolog file for graph finding the path
graphCuts
- Graph Cuts (bib imagine++)
Basedonthecognitivenetworkofgraphcoloringmodelofth
- 本文研究了认知网络中基于图论着色模型的频谱分配算法。-This paper studies the cognitive network model based on graph theory spectrum allocation algorithm for coloring.
StatusChart
- 可以直接用的一个C#图表绘制控件，能做出很漂亮的折线图、饼图等-Can be directly used in a C# graph drawing control, can make a very nice line graph, pie, etc.
maxflow-v3.0.src
- MAXFLOW - software for computing mincut/maxflow in a graph Version 3.0- MAXFLOW - software for computing mincut/maxflow in a graph Version 3.0