CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - graph
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search - graph - List
[
Mathimatics-Numerical algorithms
]
OP-GRAPH.zip
DL : 0
图的创建和遍历
Date
: 2026-01-01
Size
: 6.74kb
User
:
[
Mathimatics-Numerical algorithms
]
Graph-Theory
DL : 0
图论算法库,包括以下算法: 单源最短路径 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++上。
Date
: 2008-10-13
Size
: 9.79kb
User
:
lllstar
[
Mathimatics-Numerical algorithms
]
acopt
DL : 0
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
Date
: 2026-01-01
Size
: 20kb
User
:
无心
[
Mathimatics-Numerical algorithms
]
matlab_bgl-2.0
DL : 0
The MatlabBGL library fills a hole in Matlab s suite of algorithms. Namely, it provides a rich set of algorithms to work with graphs, as in graph theory graphs. The MatlabBGL package uses Matlab s native sparse matrix type as a graph and provides algorithms that work -The MatlabBGL library fills a hole in Matla b's suite of algorithms. Namely, it provides a rich set of algorithms to work with graphs. as in graph theory graphs. The MatlabBGL packag e uses Matlab's native sparse matrix type as a gra ph and provides algorithms that work
Date
: 2026-01-01
Size
: 2.75mb
User
:
Tom
[
Mathimatics-Numerical algorithms
]
max_planar_sa
DL : 0
用经典的局部搜索算法模拟退火算法求解一个图的最大可平面子图。-With the classic local search algorithm simulated annealing algorithm for solving a graph of maximum planar subgraph.
Date
: 2026-01-01
Size
: 54kb
User
:
张清国
[
Mathimatics-Numerical algorithms
]
Graph-Theory
DL : 1
图论算法库,包括以下算法: 单源最短路径 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
Date
: 2026-01-01
Size
: 10kb
User
:
lllstar
[
Mathimatics-Numerical algorithms
]
C
DL : 0
C编程 完美数值算法 经典的数据结构算法,包括数论算法,图论算法,背包问题等-C programming classic numerical algorithm perfect data structure algorithms, including number theory algorithms, graph theory, algorithms, and so on knapsack problem
Date
: 2026-01-01
Size
: 15kb
User
:
杨群
[
Mathimatics-Numerical algorithms
]
NPE
DL : 0
本代码实现基于成对约束的半监督图嵌入算法-Following the intuition that the image variation of faces can be effectively modeled by low dimensional linear spaces, we propose a novel linear subspace learning method for face analysis in the framework of graph embedding model, called Semi-supervised Graph Embedding (SGE). This algorithm builds an adjacency graph which can best respect the geometry structure inferred from the must-link pairwise constraints, which specify a pair of instances belong to the same class. The projections are obtained by preserving such a graph structure. Using the notion of graph Laplacian, SGE has a closed solution of an eigen-problem of some specific Laplacian matrix and therefore it is quite efficient. Experimental results on Yale standard face database demonstrate the effectiveness of our proposed algorithm.
Date
: 2026-01-01
Size
: 2kb
User
:
刘国胜
[
Mathimatics-Numerical algorithms
]
Graph_tools_collection
DL : 0
A cellection of Matlab toolboxes on Graph Theory from Mathworks around the worlds. Over 10 tools are included.
Date
: 2026-01-01
Size
: 15.8mb
User
:
askool
[
Mathimatics-Numerical algorithms
]
Insight_Journal_306_1
DL : 0
graph cut source code and reference paper
Date
: 2026-01-01
Size
: 2.03mb
User
:
linfan
[
Mathimatics-Numerical algorithms
]
GraphPrj
DL : 0
针对大规模稀疏无向图开发的聚类算法。附带测试页面-this program is supposed to embark on the undiret graph clustering issue.
Date
: 2026-01-01
Size
: 138kb
User
:
zhangxucheng
[
Mathimatics-Numerical algorithms
]
Algorithms.In.C.3rd.Ed.Part5.Graph.Algorithms
DL : 0
经典算法书(中文版)。这一套算法系列书介绍了当今最重要的算法,共分3卷,这是第2卷(第五部分),集中讲解图算法。本书共有6章(第17章~第22章)。第17章详细讨论图性质和类型,第18章~第22章分别讲解图搜索、有向图和DAG、最小生成树、最短路径以及网络流。书中提供了用C语言描述的完整算法源程序,并且配有丰富的插图和练习。-Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick s thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book s expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: * A complete overview of graph properties and types * Diagraphs and DAGs * Minimum spanning trees * Shortest paths * Network flows * Diagrams, sample C code, and detailed algorithm descriptions
Date
: 2026-01-01
Size
: 13.26mb
User
:
wang
[
Mathimatics-Numerical algorithms
]
Primukas.java.tar
DL : 0
In computer science, Prim s algorithm is an algorithm that finds a minimum spanning tree for a connected weighted undirected graph.
Date
: 2026-01-01
Size
: 1kb
User
:
Justas
[
Mathimatics-Numerical algorithms
]
Coloring_a_graph_using_split_decomposition
DL : 0
A solution for Graph Coloring problem Coloring a graph using split decomposition
Date
: 2026-01-01
Size
: 58kb
User
:
Hydrae
[
Mathimatics-Numerical algorithms
]
GraphCuts
DL : 0
Graph Cuts Approach to the Problems of Image Segmentation
Date
: 2026-01-01
Size
: 1.42mb
User
:
alex
[
Mathimatics-Numerical algorithms
]
graph_coloring
DL : 0
this algorithm uses genetic algorithm for solve graph coloring problem
Date
: 2026-01-01
Size
: 2kb
User
:
salar
[
Mathimatics-Numerical algorithms
]
Multi-camera-Scene-Reconstruction-via-Graph-Cuts.
DL : 0
This is 3D reconstruction algorithm
Date
: 2026-01-01
Size
: 188kb
User
:
sonhg
[
Mathimatics-Numerical algorithms
]
C-graph
DL : 0
C算法 图算法 相当有用的电子书 适合入门的算法学习-C algorithm graph algorithms very useful book for entry-learning algorithm
Date
: 2026-01-01
Size
: 14.03mb
User
:
jiangzhuo
[
Mathimatics-Numerical algorithms
]
Graph-Drawing-by-Force-directed
DL : 0
这是关于force-direct算法的可视化方向的论文,主要为了使得画布中的各点分布均匀,弹簧与戒指模型说得很不错。-This is about the force-direct visualization of the algorithm the direction of the paper, the main canvas in order to make the points evenly distributed spring model very well with the ring.
Date
: 2026-01-01
Size
: 375kb
User
:
lovell
[
Mathimatics-Numerical algorithms
]
graph
DL : 0
数据与算法课程powerpoint,图部分全部相关算法以及分析-Data and algorithms courses PowerPoint, graph section all the relevant algorithm and analysis
Date
: 2026-01-01
Size
: 1.83mb
User
:
lengbj
«
1
2
3
4
5
6
7
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.